Base | Representation |
---|---|
bin | 10000001011101110010… |
… | …101010010101010000100 |
3 | 10221022112011120121120112 |
4 | 100023232111102222010 |
5 | 121210040112334340 |
6 | 2210520341052152 |
7 | 143226610026614 |
oct | 20135625225204 |
9 | 3838464517515 |
10 | 1112100121220 |
11 | 399703587180 |
12 | 15b6480b7058 |
13 | 80b418c680a |
14 | 3bb7c508a44 |
15 | 1dddcdec065 |
hex | 102ee552a84 |
1112100121220 has 48 divisors (see below), whose sum is σ = 2576346393600. Its totient is φ = 399856216320.
The previous prime is 1112100121211. The next prime is 1112100121343. The reversal of 1112100121220 is 221210012111.
It is a junction number, because it is equal to n+sod(n) for n = 1112100121195 and 1112100121204.
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 15 ways as a sum of consecutive naturals, for example, 28379300 + ... + 28418459.
It is an arithmetic number, because the mean of its divisors is an integer number (53673883200).
Almost surely, 21112100121220 is an apocalyptic number.
1112100121220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1112100121220 is an abundant number, since it is smaller than the sum of its proper divisors (1464246272380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112100121220 is a wasteful number, since it uses less digits than its factorization.
1112100121220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56797868 (or 56797866 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1112100121220 its reverse (221210012111), we get a palindrome (1333310133331).
The spelling of 1112100121220 in words is "one trillion, one hundred twelve billion, one hundred million, one hundred twenty-one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •