Search a number
-
+
10695954064 = 24668497129
BaseRepresentation
bin10011111011000011…
…10100111010010000
31000121102022202121211
421331201310322100
5133401131012224
64525203225504
7526025052355
oct117541647220
930542282554
1010695954064
114599650664
1220a6078294
131015c41103
1473676662c
15429031894
hex27d874e90

10695954064 has 10 divisors (see below), whose sum is σ = 20723411030. Its totient is φ = 5347977024.

The previous prime is 10695954047. The next prime is 10695954079. The reversal of 10695954064 is 46045959601.

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

It can be written as a sum of positive squares in only one way, i.e., 6272640000 + 4423314064 = 79200^2 + 66508^2 .

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

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

It is an unprimeable number.

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 as a sum of consecutive naturals, namely, 334248549 + ... + 334248580.

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

Almost surely, 210695954064 is an apocalyptic number.

It is an amenable number.

10695954064 is a deficient number, since it is larger than the sum of its proper divisors (10027456966).

10695954064 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 1166400, while the sum is 49.

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

Divisors: 1 2 4 8 16 668497129 1336994258 2673988516 5347977032 10695954064