Base | Representation |
---|---|
bin | 11001011111100101000000… |
… | …111001001101011001111100 |
3 | 112200222200102220101122221012 |
4 | 121133211000321031121330 |
5 | 104143443214230013040 |
6 | 1034243434531454352 |
7 | 32421330051161033 |
oct | 3137450071153174 |
9 | 480880386348835 |
10 | 112121210001020 |
11 | 327a837a062840 |
12 | 106a9a124573b8 |
13 | 4a73ca560650c |
14 | 1d989a470b71a |
15 | ce67e3a09865 |
hex | 65f940e4d67c |
112121210001020 has 96 divisors (see below), whose sum is σ = 257118409175040. Its totient is φ = 40730259944960.
The previous prime is 112121210000999. The next prime is 112121210001089. The reversal of 112121210001020 is 20100012121211.
It is a junction number, because it is equal to n+sod(n) for n = 112121210000986 and 112121210001004.
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, 3435806624 + ... + 3435839256.
It is an arithmetic number, because the mean of its divisors is an integer number (2678316762240).
Almost surely, 2112121210001020 is an apocalyptic number.
112121210001020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112121210001020 is an abundant number, since it is smaller than the sum of its proper divisors (144997199174020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112121210001020 is a wasteful number, since it uses less digits than its factorization.
112121210001020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47915 (or 47913 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 112121210001020 its reverse (20100012121211), we get a palindrome (132221222122231).
The spelling of 112121210001020 in words is "one hundred twelve trillion, one hundred twenty-one billion, two hundred ten million, one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •