Base | Representation |
---|---|
bin | 10011111010001100… |
… | …00001010101111001 |
3 | 1000120220121102211202 |
4 | 21331012001111321 |
5 | 133342244234303 |
6 | 4524343103545 |
7 | 525606103331 |
oct | 117506012571 |
9 | 30526542752 |
10 | 10688664953 |
11 | 45955221aa |
12 | 20a3741bb5 |
13 | 101458b425 |
14 | 7357ca0c1 |
15 | 428591c88 |
hex | 27d181579 |
10688664953 has 2 divisors, whose sum is σ = 10688664954. Its totient is φ = 10688664952.
The previous prime is 10688664923. The next prime is 10688664977. The reversal of 10688664953 is 35946688601.
It is a happy number.
10688664953 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6745829689 + 3942835264 = 82133^2 + 62792^2 .
It is a cyclic number.
It is not a de Polignac number, because 10688664953 - 228 = 10420229497 is a prime.
It is a super-2 number, since 2×106886649532 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10688664923) 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 as a sum of consecutive naturals, namely, 5344332476 + 5344332477.
It is an arithmetic number, because the mean of its divisors is an integer number (5344332477).
Almost surely, 210688664953 is an apocalyptic number.
It is an amenable number.
10688664953 is a deficient number, since it is larger than the sum of its proper divisors (1).
10688664953 is an equidigital number, since it uses as much as digits as its factorization.
10688664953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7464960, while the sum is 56.
The spelling of 10688664953 in words is "ten billion, six hundred eighty-eight million, six hundred sixty-four thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •