Base | Representation |
---|---|
bin | 1011000110001000100111… |
… | …1111011010010010110001 |
3 | 1121012022101112011210010221 |
4 | 2301202021333122102301 |
5 | 3044341121142101001 |
6 | 41540340212253041 |
7 | 2366264631601465 |
oct | 261421177322261 |
9 | 47168345153127 |
10 | 12200022222001 |
11 | 3984000543799 |
12 | 1450542911181 |
13 | 6a65c34bc673 |
14 | 3026aca064a5 |
15 | 16253d2d41a1 |
hex | b1889fda4b1 |
12200022222001 has 2 divisors, whose sum is σ = 12200022222002. Its totient is φ = 12200022222000.
The previous prime is 12200022221987. The next prime is 12200022222013. The reversal of 12200022222001 is 10022222000221.
12200022222001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12194406218401 + 5616003600 = 3492049^2 + 74940^2 .
It is a cyclic number.
It is not a de Polignac number, because 12200022222001 - 221 = 12200020124849 is a prime.
It is not a weakly prime, because it can be changed into another prime (12200022222701) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6100011111000 + 6100011111001.
It is an arithmetic number, because the mean of its divisors is an integer number (6100011111001).
Almost surely, 212200022222001 is an apocalyptic number.
It is an amenable number.
12200022222001 is a deficient number, since it is larger than the sum of its proper divisors (1).
12200022222001 is an equidigital number, since it uses as much as digits as its factorization.
12200022222001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 12200022222001 its reverse (10022222000221), we get a palindrome (22222244222222).
The spelling of 12200022222001 in words is "twelve trillion, two hundred billion, twenty-two million, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •