Base | Representation |
---|---|
bin | 1001101100000110011001… |
… | …0110101010101011011001 |
3 | 1101201102212100020000011202 |
4 | 2123001212112222223121 |
5 | 2344020311421041324 |
6 | 34354010142003545 |
7 | 2146446056601224 |
oct | 233014626525331 |
9 | 41642770200152 |
10 | 10653236112089 |
11 | 343801506856a |
12 | 12408032765b5 |
13 | 5c379912926c |
14 | 28b89580c5bb |
15 | 1371ad7d88ae |
hex | 9b0665aaad9 |
10653236112089 has 2 divisors, whose sum is σ = 10653236112090. Its totient is φ = 10653236112088.
The previous prime is 10653236112059. The next prime is 10653236112137. The reversal of 10653236112089 is 98021163235601.
10653236112089 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5759040040000 + 4894196072089 = 2399800^2 + 2212283^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10653236112089 is a prime.
It is a super-2 number, since 2×106532361120892 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10653236112059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5326618056044 + 5326618056045.
It is an arithmetic number, because the mean of its divisors is an integer number (5326618056045).
Almost surely, 210653236112089 is an apocalyptic number.
It is an amenable number.
10653236112089 is a deficient number, since it is larger than the sum of its proper divisors (1).
10653236112089 is an equidigital number, since it uses as much as digits as its factorization.
10653236112089 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 466560, while the sum is 47.
The spelling of 10653236112089 in words is "ten trillion, six hundred fifty-three billion, two hundred thirty-six million, one hundred twelve thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •