Base | Representation |
---|---|
bin | 11110100100101110101… |
… | …111000111110000001000 |
3 | 21102212002220122200022020 |
4 | 132210232233013300020 |
5 | 233410343404042300 |
6 | 4245110252524440 |
7 | 304536211534665 |
oct | 36445657076010 |
9 | 7385086580266 |
10 | 2101023112200 |
11 | 740047856261 |
12 | 29b238480720 |
13 | 123183013b3c |
14 | 73993756a6c |
15 | 399bbe618a0 |
hex | 1e92ebc7c08 |
2101023112200 has 96 divisors (see below), whose sum is σ = 6855970192800. Its totient is φ = 530784783360.
The previous prime is 2101023112159. The next prime is 2101023112213. The reversal of 2101023112200 is 22113201012.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2101023112200.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 92138737 + ... + 92161536.
It is an arithmetic number, because the mean of its divisors is an integer number (71416356175).
Almost surely, 22101023112200 is an apocalyptic number.
2101023112200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2101023112200 is an abundant number, since it is smaller than the sum of its proper divisors (4754947080600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2101023112200 is a wasteful number, since it uses less digits than its factorization.
2101023112200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184300311 (or 184300302 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 2101023112200 its reverse (22113201012), we get a palindrome (2123136313212).
The spelling of 2101023112200 in words is "two trillion, one hundred one billion, twenty-three million, one hundred twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •