Base | Representation |
---|---|
bin | 1011000110001000100111… |
… | …0111000001001101011111 |
3 | 1121012022101101001000110112 |
4 | 2301202021313001031133 |
5 | 3044341120111201421 |
6 | 41540340053200235 |
7 | 2366264604110015 |
oct | 261421167011537 |
9 | 47168341030415 |
10 | 12200020022111 |
11 | 3983aaa2809a9 |
12 | 145054203007b |
13 | 6a65c2bcc25c |
14 | 3026ac5d28b5 |
15 | 16253ceec45b |
hex | b1889dc135f |
12200020022111 has 8 divisors (see below), whose sum is σ = 12219337743120. Its totient is φ = 12180706128448.
The previous prime is 12200020022053. The next prime is 12200020022161. The reversal of 12200020022111 is 11122002000221.
12200020022111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12200020022111 - 234 = 12182840152927 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12200020022161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5457395 + ... + 7360923.
It is an arithmetic number, because the mean of its divisors is an integer number (1527417217890).
Almost surely, 212200020022111 is an apocalyptic number.
12200020022111 is a deficient number, since it is larger than the sum of its proper divisors (19317721009).
12200020022111 is an equidigital number, since it uses as much as digits as its factorization.
12200020022111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1913673.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 12200020022111 its reverse (11122002000221), we get a palindrome (23322022022332).
The spelling of 12200020022111 in words is "twelve trillion, two hundred billion, twenty million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •