Base | Representation |
---|---|
bin | 1001001001010101111001… |
… | …00010011001000101011001 |
3 | 2122012201002210120200022020 |
4 | 10210222330202121011121 |
5 | 10114004241200341441 |
6 | 110435230033445053 |
7 | 4144026031261560 |
oct | 444527442310531 |
9 | 78181083520266 |
10 | 20112200012121 |
11 | 6454599645888 |
12 | 2309a67110789 |
13 | b2b759517959 |
14 | 4d76156c2bd7 |
15 | 24d27019de66 |
hex | 124abc899159 |
20112200012121 has 32 divisors (see below), whose sum is σ = 31953598218240. Its totient is φ = 11009013051456.
The previous prime is 20112200012119. The next prime is 20112200012173. The reversal of 20112200012121 is 12121000221102.
It is not a de Polignac number, because 20112200012121 - 21 = 20112200012119 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20112200012121.
It is not an unprimeable number, because it can be changed into a prime (20112200012221) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 129942181 + ... + 130096866.
It is an arithmetic number, because the mean of its divisors is an integer number (998549944320).
Almost surely, 220112200012121 is an apocalyptic number.
20112200012121 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20112200012121 is a deficient number, since it is larger than the sum of its proper divisors (11841398206119).
20112200012121 is a wasteful number, since it uses less digits than its factorization.
20112200012121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 260039213.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 20112200012121 its reverse (12121000221102), we get a palindrome (32233200233223).
The spelling of 20112200012121 in words is "twenty trillion, one hundred twelve billion, two hundred million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •