Base | Representation |
---|---|
bin | 1001001100100110001000… |
… | …1111011010011001001101 |
3 | 1022210200211202021211222222 |
4 | 2103021202033122121031 |
5 | 2311133334303102341 |
6 | 33301220023545125 |
7 | 2062365550130003 |
oct | 223114217323115 |
9 | 38720752254888 |
10 | 10112001222221 |
11 | 3249526085a98 |
12 | 11739348bb1a5 |
13 | 584733139b92 |
14 | 26d5d0008a73 |
15 | 128082a9044b |
hex | 932623da64d |
10112001222221 has 2 divisors, whose sum is σ = 10112001222222. Its totient is φ = 10112001222220.
The previous prime is 10112001222143. The next prime is 10112001222263. The reversal of 10112001222221 is 12222210021101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8743931796196 + 1368069426025 = 2957014^2 + 1169645^2 .
It is a cyclic number.
It is not a de Polignac number, because 10112001222221 - 210 = 10112001221197 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10112001222221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10112001222121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5056000611110 + 5056000611111.
It is an arithmetic number, because the mean of its divisors is an integer number (5056000611111).
Almost surely, 210112001222221 is an apocalyptic number.
It is an amenable number.
10112001222221 is a deficient number, since it is larger than the sum of its proper divisors (1).
10112001222221 is an equidigital number, since it uses as much as digits as its factorization.
10112001222221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 10112001222221 its reverse (12222210021101), we get a palindrome (22334211243322).
The spelling of 10112001222221 in words is "ten trillion, one hundred twelve billion, one million, two hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •