Base | Representation |
---|---|
bin | 11001011101110110001011… |
… | …111100101001111000101100 |
3 | 112200120022021121002220102212 |
4 | 121131312023330221320230 |
5 | 104140021011242023040 |
6 | 1034113034403105552 |
7 | 32406615114615155 |
oct | 3135661374517054 |
9 | 480508247086385 |
10 | 112002210111020 |
11 | 32761963797109 |
12 | 1068a9416722b8 |
13 | 4a659bc697418 |
14 | 1d92d1614092c |
15 | ce367b757d65 |
hex | 65dd8bf29e2c |
112002210111020 has 48 divisors (see below), whose sum is σ = 240993152207136. Its totient is φ = 43698780480000.
The previous prime is 112002210111019. The next prime is 112002210111049. The reversal of 112002210111020 is 20111012200211.
It is a junction number, because it is equal to n+sod(n) for n = 112002210110986 and 112002210111004.
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, 10869911 + ... + 18497550.
It is an arithmetic number, because the mean of its divisors is an integer number (5020690670982).
Almost surely, 2112002210111020 is an apocalyptic number.
112002210111020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112002210111020 is an abundant number, since it is smaller than the sum of its proper divisors (128990942096116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112002210111020 is a wasteful number, since it uses less digits than its factorization.
112002210111020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29372162 (or 29372160 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 112002210111020 its reverse (20111012200211), we get a palindrome (132113222311231).
The spelling of 112002210111020 in words is "one hundred twelve trillion, two billion, two hundred ten million, one hundred eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •