Base | Representation |
---|---|
bin | 11110100101110100111… |
… | …001010110101110111000 |
3 | 21102222010221112221101010 |
4 | 132211310321112232320 |
5 | 233420301222400440 |
6 | 4245423141553520 |
7 | 304610323605126 |
oct | 36456471265670 |
9 | 7388127487333 |
10 | 2102200200120 |
11 | 7405a1232899 |
12 | 29b5067158a0 |
13 | 12330cb45577 |
14 | 73a65c00916 |
15 | 39a3a473580 |
hex | 1e974e56bb8 |
2102200200120 has 32 divisors (see below), whose sum is σ = 6306600600720. Its totient is φ = 560586720000.
The previous prime is 2102200200103. The next prime is 2102200200127. The reversal of 2102200200120 is 210020022012.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 2102200200096 and 2102200200105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102200200127) 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, 8759167381 + ... + 8759167620.
Almost surely, 22102200200120 is an apocalyptic number.
2102200200120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2102200200120 is an abundant number, since it is smaller than the sum of its proper divisors (4204400400600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2102200200120 is a wasteful number, since it uses less digits than its factorization.
2102200200120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17518335015 (or 17518335011 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 2102200200120 its reverse (210020022012), we get a palindrome (2312220222132).
The spelling of 2102200200120 in words is "two trillion, one hundred two billion, two hundred million, two hundred thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •