Base | Representation |
---|---|
bin | 1001000110000111001010… |
… | …00001100011111111100011 |
3 | 2121211002121201112002020220 |
4 | 10203003211001203333203 |
5 | 10110144434242402321 |
6 | 110312232403134123 |
7 | 4133016426625653 |
oct | 443034501437743 |
9 | 77732551462226 |
10 | 20001210122211 |
11 | 641151375783a |
12 | 22b0450974343 |
13 | b2114bc10596 |
14 | 4d20c6c64363 |
15 | 24a4262209c6 |
hex | 1230e5063fe3 |
20001210122211 has 4 divisors (see below), whose sum is σ = 26668280162952. Its totient is φ = 13334140081472.
The previous prime is 20001210122203. The next prime is 20001210122219. The reversal of 20001210122211 is 11222101210002.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (20001210122203) and next prime (20001210122219).
It is a cyclic number.
It is not a de Polignac number, because 20001210122211 - 23 = 20001210122203 is a prime.
It is not an unprimeable number, because it can be changed into a prime (20001210122219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3333535020366 + ... + 3333535020371.
It is an arithmetic number, because the mean of its divisors is an integer number (6667070040738).
Almost surely, 220001210122211 is an apocalyptic number.
20001210122211 is a deficient number, since it is larger than the sum of its proper divisors (6667070040741).
20001210122211 is an equidigital number, since it uses as much as digits as its factorization.
20001210122211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6667070040740.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 20001210122211 its reverse (11222101210002), we get a palindrome (31223311332213).
The spelling of 20001210122211 in words is "twenty trillion, one billion, two hundred ten million, one hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •