Base | Representation |
---|---|
bin | 1001010010111100101000… |
… | …1110111100010111101110 |
3 | 1100012010111102201210112020 |
4 | 2110233022032330113232 |
5 | 2314430323222041420 |
6 | 33423303500251010 |
7 | 2103310612315215 |
oct | 224571216742756 |
9 | 40163442653466 |
10 | 10221120112110 |
11 | 3290830926026 |
12 | 1190b08540a66 |
13 | 591b02c2544b |
14 | 2749c218c07c |
15 | 12ad1c63d340 |
hex | 94bca3bc5ee |
10221120112110 has 64 divisors (see below), whose sum is σ = 24994365696000. Its totient is φ = 2674115749760.
The previous prime is 10221120112087. The next prime is 10221120112201. The reversal of 10221120112110 is 1121102112201.
It is a happy number.
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 10221120112110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 57149125 + ... + 57327695.
It is an arithmetic number, because the mean of its divisors is an integer number (390536964000).
Almost surely, 210221120112110 is an apocalyptic number.
10221120112110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10221120112110 is an abundant number, since it is smaller than the sum of its proper divisors (14773245583890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10221120112110 is a wasteful number, since it uses less digits than its factorization.
10221120112110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214633.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10221120112110 its reverse (1121102112201), we get a palindrome (11342222224311).
The spelling of 10221120112110 in words is "ten trillion, two hundred twenty-one billion, one hundred twenty million, one hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •