Base | Representation |
---|---|
bin | 100000001010010100111… |
… | …100010000101010110101 |
3 | 21211021200111200010022122 |
4 | 200022110330100222311 |
5 | 242202302133440104 |
6 | 4411151134405325 |
7 | 315450431110322 |
oct | 40122474205265 |
9 | 7737614603278 |
10 | 2210112015029 |
11 | 7823376845a6 |
12 | 2b8402060845 |
13 | 130549830299 |
14 | 78d81931b49 |
15 | 3c7540896be |
hex | 20294f10ab5 |
2210112015029 has 2 divisors, whose sum is σ = 2210112015030. Its totient is φ = 2210112015028.
The previous prime is 2210112015011. The next prime is 2210112015107. The reversal of 2210112015029 is 9205102110122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1779283874404 + 430828140625 = 1333898^2 + 656375^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2210112015029 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2210112014989 and 2210112015007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2210112015929) 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, 1105056007514 + 1105056007515.
It is an arithmetic number, because the mean of its divisors is an integer number (1105056007515).
Almost surely, 22210112015029 is an apocalyptic number.
It is an amenable number.
2210112015029 is a deficient number, since it is larger than the sum of its proper divisors (1).
2210112015029 is an equidigital number, since it uses as much as digits as its factorization.
2210112015029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 26.
The spelling of 2210112015029 in words is "two trillion, two hundred ten billion, one hundred twelve million, fifteen thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •