Base | Representation |
---|---|
bin | 1001101001000010001001… |
… | …01100001111001001011010 |
3 | 2210001210202212202021201121 |
4 | 10310201010230033021122 |
5 | 10234324333410120442 |
6 | 113031353403435454 |
7 | 4315505203156435 |
oct | 464410454171132 |
9 | 83053685667647 |
10 | 21201111020122 |
11 | 6834382505a80 |
12 | 2464b01225b8a |
13 | baa343b0a3a7 |
14 | 5341d415281c |
15 | 26b752382967 |
hex | 134844b0f25a |
21201111020122 has 32 divisors (see below), whose sum is σ = 34708163745024. Its totient is φ = 9632581483200.
The previous prime is 21201111020099. The next prime is 21201111020143. The reversal of 21201111020122 is 22102011110212.
It is a super-2 number, since 2×212011110201222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21201111020096 and 21201111020105.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 978757972 + ... + 978779632.
It is an arithmetic number, because the mean of its divisors is an integer number (1084630117032).
Almost surely, 221201111020122 is an apocalyptic number.
21201111020122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21201111020122 is a deficient number, since it is larger than the sum of its proper divisors (13507052724902).
21201111020122 is a wasteful number, since it uses less digits than its factorization.
21201111020122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39414.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 21201111020122 its reverse (22102011110212), we get a palindrome (43303122130334).
The spelling of 21201111020122 in words is "twenty-one trillion, two hundred one billion, one hundred eleven million, twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •