Base | Representation |
---|---|
bin | 11001011111100011111111… |
… | …111011101001101010011010 |
3 | 112200222120121221121001222221 |
4 | 121133203333323221222122 |
5 | 104143434001222401020 |
6 | 1034243134435534254 |
7 | 32421261045310150 |
oct | 3137437773515232 |
9 | 480876557531887 |
10 | 112120120122010 |
11 | 327a796a930590 |
12 | 106a976945a38a |
13 | 4a73b6088a4b0 |
14 | 1d988dda853d0 |
15 | ce677cec26aa |
hex | 65f8ffee9a9a |
112120120122010 has 256 divisors, whose sum is σ = 295067191910400. Its totient is φ = 29506716288000.
The previous prime is 112120120121963. The next prime is 112120120122013. The reversal of 112120120122010 is 10221021021211.
It is not an unprimeable number, because it can be changed into a prime (112120120122013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 4648566 + ... + 15679585.
It is an arithmetic number, because the mean of its divisors is an integer number (1152606218400).
Almost surely, 2112120120122010 is an apocalyptic number.
112120120122010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112120120122010 is an abundant number, since it is smaller than the sum of its proper divisors (182947071788390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112120120122010 is a wasteful number, since it uses less digits than its factorization.
112120120122010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20328237.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 112120120122010 its reverse (10221021021211), we get a palindrome (122341141143221).
The spelling of 112120120122010 in words is "one hundred twelve trillion, one hundred twenty billion, one hundred twenty million, one hundred twenty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •