Base | Representation |
---|---|
bin | 1001101001000010001001… |
… | …01100100101010111010010 |
3 | 2210001210202212220220112222 |
4 | 10310201010230211113102 |
5 | 10234324333421023442 |
6 | 113031353405421042 |
7 | 4315505204015645 |
oct | 464410454452722 |
9 | 83053685826488 |
10 | 21201111111122 |
11 | 6834382568388 |
12 | 2464b0126a782 |
13 | baa343b3c937 |
14 | 5341d4177a5c |
15 | 26b75239e8d2 |
hex | 134844b255d2 |
21201111111122 has 16 divisors (see below), whose sum is σ = 33190218452160. Its totient is φ = 10137868033392.
The previous prime is 21201111111097. The next prime is 21201111111127. The reversal of 21201111111122 is 22111111110212.
It is a super-2 number, since 2×212011111111222 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21201111111122.
It is not an unprimeable number, because it can be changed into a prime (21201111111127) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 40505372 + ... + 41025447.
It is an arithmetic number, because the mean of its divisors is an integer number (2074388653260).
Almost surely, 221201111111122 is an apocalyptic number.
21201111111122 is a deficient number, since it is larger than the sum of its proper divisors (11989107341038).
21201111111122 is a wasteful number, since it uses less digits than its factorization.
21201111111122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81536497.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 21201111111122 its reverse (22111111110212), we get a palindrome (43312222221334).
The spelling of 21201111111122 in words is "twenty-one trillion, two hundred one billion, one hundred eleven million, one hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •