Base | Representation |
---|---|
bin | 100000000001000110110… |
… | …111001010100111110101 |
3 | 21210100010120021110021121 |
4 | 200001012313022213311 |
5 | 242022013300401401 |
6 | 4402432525343541 |
7 | 314650210314610 |
oct | 40010667124765 |
9 | 7710116243247 |
10 | 2200212122101 |
11 | 779117424504 |
12 | 2b64ba707bb1 |
13 | 12c62c7c3286 |
14 | 786c2bcb177 |
15 | 3c374da2ca1 |
hex | 20046dca9f5 |
2200212122101 has 8 divisors (see below), whose sum is σ = 2514537900864. Its totient is φ = 1885888783680.
The previous prime is 2200212122081. The next prime is 2200212122123. The reversal of 2200212122101 is 1012212120022.
It is a happy number.
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 2200212122101 - 29 = 2200212121589 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 (2200212132101) 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, 2161101 + ... + 3011773.
It is an arithmetic number, because the mean of its divisors is an integer number (314317237608).
Almost surely, 22200212122101 is an apocalyptic number.
It is an amenable number.
2200212122101 is a deficient number, since it is larger than the sum of its proper divisors (314325778763).
2200212122101 is an equidigital number, since it uses as much as digits as its factorization.
2200212122101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1220171.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 2200212122101 its reverse (1012212120022), we get a palindrome (3212424242123).
The spelling of 2200212122101 in words is "two trillion, two hundred billion, two hundred twelve million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •