| Base | Representation |
|---|---|
| bin | 11001000010010101111110… |
| … | …100100101000100010100000 |
| 3 | 112102212121211112211102022100 |
| 4 | 121002111332210220202200 |
| 5 | 103413034241211200000 |
| 6 | 1030104502453210400 |
| 7 | 32123225652603660 |
| oct | 3102257644504240 |
| 9 | 472777745742270 |
| 10 | 110112200100000 |
| 11 | 320a335a378a6a |
| 12 | 10424595030a00 |
| 13 | 49596c7536387 |
| 14 | 1d2965d3ca1a0 |
| 15 | cae40ea46a00 |
| hex | 64257e9288a0 |
110112200100000 has 864 divisors, whose sum is σ = 448225777464192. Its totient is φ = 25116537600000.
The previous prime is 110112200099933. The next prime is 110112200100031. The reversal of 110112200100000 is 1002211011.
It is a happy number.
It is a super-2 number, since 2×1101122001000002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 3093282202 + ... + 3093317798.
It is an arithmetic number, because the mean of its divisors is an integer number (518779835028).
Almost surely, 2110112200100000 is an apocalyptic number.
110112200100000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 110112200100000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (224112888732096).
110112200100000 is an abundant number, since it is smaller than the sum of its proper divisors (338113577364192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110112200100000 is an equidigital number, since it uses as much as digits as its factorization.
110112200100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36136 (or 36105 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110112200100000 its reverse (1002211011), we get a palindrome (110113202311011).
The spelling of 110112200100000 in words is "one hundred ten trillion, one hundred twelve billion, two hundred million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •