1316891383625998382687 1932664434653483055919326644346528796447 bytes
Brainfuck code:
>+[+[[+>->-<<].->>+]<]>>+].<] Prints
2894802230932904885589274625217197696331749616641014100986439600197828240998357896044618658097711785492504343953926634992332820282019728792003956564819967 null bytes.
It works like this:
mem[i]=255; do while(--mem[i]){ mem[i+1]=mem[i+2]=mem[i]; mem[i]=1; i+=2; } while(mem[--i]); Quite straightforward recursion.