Base | Representation |
---|---|
bin | 1001100110101110110010… |
… | …11100000010101000011101 |
3 | 2202210020120122112220020011 |
4 | 10303113121130002220131 |
5 | 10232030330030413432 |
6 | 112531151443123221 |
7 | 4310004622253236 |
oct | 463273134025035 |
9 | 82706518486204 |
10 | 21122002201117 |
11 | 6803877658414 |
12 | 2451703973511 |
13 | ba2a47501b0c |
14 | 53044b8ba08d |
15 | 26967224c847 |
hex | 1335d9702a1d |
21122002201117 has 2 divisors, whose sum is σ = 21122002201118. Its totient is φ = 21122002201116.
The previous prime is 21122002201109. The next prime is 21122002201141. The reversal of 21122002201117 is 71110220022112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18475374293401 + 2646627907716 = 4298299^2 + 1626846^2 .
It is a cyclic number.
It is not a de Polignac number, because 21122002201117 - 23 = 21122002201109 is a prime.
It is a super-2 number, since 2×211220022011172 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21122002204117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10561001100558 + 10561001100559.
It is an arithmetic number, because the mean of its divisors is an integer number (10561001100559).
Almost surely, 221122002201117 is an apocalyptic number.
It is an amenable number.
21122002201117 is a deficient number, since it is larger than the sum of its proper divisors (1).
21122002201117 is an equidigital number, since it uses as much as digits as its factorization.
21122002201117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 21122002201117 its reverse (71110220022112), we get a palindrome (92232222223229).
The spelling of 21122002201117 in words is "twenty-one trillion, one hundred twenty-two billion, two million, two hundred one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •