Base | Representation |
---|---|
bin | 1011000000011011011101… |
… | …1110111110000111011110 |
3 | 1120211221101021101001200120 |
4 | 2300012313132332013132 |
5 | 3041234344303101420 |
6 | 41423325502135410 |
7 | 2356224605052552 |
oct | 260066736760736 |
9 | 46757337331616 |
10 | 12102001222110 |
11 | 3946480211778 |
12 | 1435547881566 |
13 | 69a2a19b3a07 |
14 | 2dba50735862 |
15 | 15ec02baed40 |
hex | b01b77be1de |
12102001222110 has 32 divisors (see below), whose sum is σ = 30753320753952. Its totient is φ = 3037365012480.
The previous prime is 12102001222039. The next prime is 12102001222123. The reversal of 12102001222110 is 1122210020121.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 12102001222110.
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, 11864706571 + ... + 11864707590.
It is an arithmetic number, because the mean of its divisors is an integer number (961041273561).
Almost surely, 212102001222110 is an apocalyptic number.
12102001222110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12102001222110 is an abundant number, since it is smaller than the sum of its proper divisors (18651319531842).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12102001222110 is a wasteful number, since it uses less digits than its factorization.
12102001222110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23729414188.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 12102001222110 its reverse (1122210020121), we get a palindrome (13224211242231).
The spelling of 12102001222110 in words is "twelve trillion, one hundred two billion, one million, two hundred twenty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •