Base | Representation |
---|---|
bin | 100000000001000001011… |
… | …111111000011001000000 |
3 | 21210022220021221111010002 |
4 | 200001001133320121000 |
5 | 242021322231211112 |
6 | 4402415552455132 |
7 | 314645035363106 |
oct | 40010137703100 |
9 | 7708807844102 |
10 | 2200122132032 |
11 | 77908064a650 |
12 | 2b649454a4a8 |
13 | 12c616c75a06 |
14 | 786b4c83c76 |
15 | 3c36c0291c2 |
hex | 200417f8640 |
2200122132032 has 56 divisors (see below), whose sum is σ = 4763053163232. Its totient is φ = 999994880000.
The previous prime is 2200122132017. The next prime is 2200122132037. The reversal of 2200122132032 is 2302312210022.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 2200122131995 and 2200122132013.
It is not an unprimeable number, because it can be changed into a prime (2200122132037) 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, 12763088 + ... + 12934320.
It is an arithmetic number, because the mean of its divisors is an integer number (85054520772).
Almost surely, 22200122132032 is an apocalyptic number.
2200122132032 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2200122132032 is an abundant number, since it is smaller than the sum of its proper divisors (2562931031200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2200122132032 is a wasteful number, since it uses less digits than its factorization.
2200122132032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 189507 (or 189497 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 2200122132032 its reverse (2302312210022), we get a palindrome (4502434342054).
The spelling of 2200122132032 in words is "two trillion, two hundred billion, one hundred twenty-two million, one hundred thirty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •