Search a number
-
+
10696256064 = 263413229421
BaseRepresentation
bin10011111011000101…
…11110101001000000
31000121102220002220000
421331202332221000
5133401220143224
64525213520000
7526030451004
oct117542765100
930542802800
1010696256064
11459983754a
1220a61a3000
131016018700
14736804704
154290910c9
hex27d8bea40

10696256064 has 420 divisors, whose sum is σ = 35601958260. Its totient is φ = 3170119680.

The previous prime is 10696256059. The next prime is 10696256069. The reversal of 10696256064 is 46065269601.

10696256064 is a `hidden beast` number, since 10 + 6 + 9 + 6 + 25 + 606 + 4 = 666.

10696256064 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is an interprime number because it is at equal distance from previous prime (10696256059) and next prime (10696256069).

It can be written as a sum of positive squares in 6 ways, for example, as 4827470400 + 5868785664 = 69480^2 + 76608^2 .

It is a super-2 number, since 2×106962560642 (a number of 21 digits) contains 22 as substring.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10696256069) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 25406574 + ... + 25406994.

Almost surely, 210696256064 is an apocalyptic number.

It is an amenable number.

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

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

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

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

10696256064 is an odious number, because the sum of its binary digits is odd.

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

The product of its (nonzero) digits is 466560, while the sum is 45.

The spelling of 10696256064 in words is "ten billion, six hundred ninety-six million, two hundred fifty-six thousand, sixty-four".