Base | Representation |
---|---|
bin | 11001100001000001111110… |
… | …001001110011101010100100 |
3 | 112201100020001222022002000021 |
4 | 121201001332021303222210 |
5 | 104202112123113310040 |
6 | 1034401343101324524 |
7 | 32431462353226600 |
oct | 3141017611635244 |
9 | 481306058262007 |
10 | 112221022010020 |
11 | 32836739368480 |
12 | 10705229266744 |
13 | 4a805211a4a81 |
14 | 1d9d7527d4500 |
15 | ce91d64ad24a |
hex | 66107e273aa4 |
112221022010020 has 72 divisors (see below), whose sum is σ = 299061736606080. Its totient is φ = 34977980882880.
The previous prime is 112221022010003. The next prime is 112221022010113. The reversal of 112221022010020 is 20010220122211.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 112221022009976 and 112221022010003.
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, 5205045900 + ... + 5205067459.
It is an arithmetic number, because the mean of its divisors is an integer number (4153635230640).
Almost surely, 2112221022010020 is an apocalyptic number.
112221022010020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112221022010020 is an abundant number, since it is smaller than the sum of its proper divisors (186840714596060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112221022010020 is a wasteful number, since it uses less digits than its factorization.
112221022010020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10410113393 (or 10410113384 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 112221022010020 its reverse (20010220122211), we get a palindrome (132231242132231).
The spelling of 112221022010020 in words is "one hundred twelve trillion, two hundred twenty-one billion, twenty-two million, ten thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •