Base | Representation |
---|---|
bin | 1001010010111101000000… |
… | …1100011100111000000000 |
3 | 1100012010202101220211110101 |
4 | 2110233100030130320000 |
5 | 2314431024322401422 |
6 | 33423321432012144 |
7 | 2103313235351446 |
oct | 224572014347000 |
9 | 40163671824411 |
10 | 10221220122112 |
11 | 329088232401a |
12 | 1190b35b31054 |
13 | 591b1a87066c |
14 | 2749d1582b96 |
15 | 12ad262e5c27 |
hex | 94bd031ce00 |
10221220122112 has 40 divisors (see below), whose sum is σ = 20476362475800. Its totient is φ = 5097125505024.
The previous prime is 10221220122097. The next prime is 10221220122203. The reversal of 10221220122112 is 21122102212201.
It is a self number, because there is not a number n which added to its sum of digits gives 10221220122112.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26142787 + ... + 26530882.
It is an arithmetic number, because the mean of its divisors is an integer number (511909061895).
Almost surely, 210221220122112 is an apocalyptic number.
It is an amenable number.
10221220122112 is an abundant number, since it is smaller than the sum of its proper divisors (10255142353688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10221220122112 is an frugal number, since it uses more digits than its factorization.
10221220122112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52674066 (or 52674050 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 10221220122112 its reverse (21122102212201), we get a palindrome (31343322334313).
The spelling of 10221220122112 in words is "ten trillion, two hundred twenty-one billion, two hundred twenty million, one hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •