Base | Representation |
---|---|
bin | 100000000001000000001… |
… | …011100001111110011000 |
3 | 21210022211202100002021101 |
4 | 200001000023201332120 |
5 | 242021301101120440 |
6 | 4402413442521144 |
7 | 314644346416642 |
oct | 40010013417630 |
9 | 7708752302241 |
10 | 2200100020120 |
11 | 77906a117642 |
12 | 2b64890661b4 |
13 | 12c612503242 |
14 | 786b1d69892 |
15 | 3c36a10c69a |
hex | 200402e1f98 |
2200100020120 has 64 divisors (see below), whose sum is σ = 5018405051520. Its totient is φ = 867920891904.
The previous prime is 2200100020109. The next prime is 2200100020163. The reversal of 2200100020120 is 210200010022.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 2200100020097 and 2200100020106.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 70394337 + ... + 70425583.
It is an arithmetic number, because the mean of its divisors is an integer number (78412578930).
Almost surely, 22200100020120 is an apocalyptic number.
2200100020120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2200100020120 is an abundant number, since it is smaller than the sum of its proper divisors (2818305031400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2200100020120 is a wasteful number, since it uses less digits than its factorization.
2200100020120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55444 (or 55440 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 2200100020120 its reverse (210200010022), we get a palindrome (2410300030142).
The spelling of 2200100020120 in words is "two trillion, two hundred billion, one hundred million, twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •