Base | Representation |
---|---|
bin | 100000000001000001011… |
… | …111011101010010010100 |
3 | 21210022220021201211211020 |
4 | 200001001133131102110 |
5 | 242021322214133022 |
6 | 4402415550241140 |
7 | 314645034421326 |
oct | 40010137352224 |
9 | 7708807654736 |
10 | 2200122021012 |
11 | 7790805841a3 |
12 | 2b64944b61b0 |
13 | 12c616c37316 |
14 | 786b4c55616 |
15 | 3c36c00635c |
hex | 200417dd494 |
2200122021012 has 12 divisors (see below), whose sum is σ = 5133618049056. Its totient is φ = 733374007000.
The previous prime is 2200122021011. The next prime is 2200122021037. The reversal of 2200122021012 is 2101202210022.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 2200122020982 and 2200122021000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2200122021011) 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, 91671750864 + ... + 91671750887.
It is an arithmetic number, because the mean of its divisors is an integer number (427801504088).
Almost surely, 22200122021012 is an apocalyptic number.
It is an amenable number.
2200122021012 is an abundant number, since it is smaller than the sum of its proper divisors (2933496028044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2200122021012 is a wasteful number, since it uses less digits than its factorization.
2200122021012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 183343501758 (or 183343501756 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2200122021012 its reverse (2101202210022), we get a palindrome (4301324231034).
The spelling of 2200122021012 in words is "two trillion, two hundred billion, one hundred twenty-two million, twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •