1068256799064 has 640 divisors, whose sum is σ = 4001591193600. Its totient is φ = 258291348480.

The previous prime is 1068256799053. The next prime is 1068256799081. The reversal of 1068256799064 is 4609976528601.

1068256799064 is a `hidden beast` number, since 1 + 0 + 6 + 8 + 2 + 567 + 9 + 9 + 0 + 64 = 666.

It is a super-2 number, since 2×1068256799064² (a number of 25 digits) contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (63).

It is a junction number, because it is equal to n+sod(n) for n = 1068256798992 and 1068256799010.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 34716774 + ... + 34747530.

It is an arithmetic number, because the mean of its divisors is an integer number (6252486240).

Almost surely, 2^{1068256799064} is an apocalyptic number.

1068256799064 is a gapful number since it is divisible by the number (14) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 1068256799064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2000795596800).

1068256799064 is an abundant number, since it is smaller than the sum of its proper divisors (2933334394536).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

1068256799064 is a wasteful number, since it uses less digits than its factorization.

1068256799064 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 30845 (or 30832 counting only the distinct ones).

The product of its (nonzero) digits is 39191040, while the sum is 63.

The spelling of 1068256799064 in words is "one trillion, sixty-eight billion, two hundred fifty-six million, seven hundred ninety-nine thousand, sixty-four".