| Base | Representation |
|---|---|
| bin | 11001000000101110011011… |
| … | …001011111011001001101000 |
| 3 | 112102110222211120221112010101 |
| 4 | 121000232123023323021220 |
| 5 | 103404224032304342300 |
| 6 | 1025541433345155144 |
| 7 | 32112211412134150 |
| oct | 3100563313731150 |
| 9 | 472428746845111 |
| 10 | 110001011012200 |
| 11 | 32060191aa5670 |
| 12 | 10406b2402bab4 |
| 13 | 494c087895b29 |
| 14 | 1d24112317760 |
| 15 | cab5a336bb6a |
| hex | 640b9b2fb268 |
110001011012200 has 768 divisors, whose sum is σ = 339749012528640. Its totient is φ = 32065978368000.
The previous prime is 110001011012173. The next prime is 110001011012227. The reversal of 110001011012200 is 2210110100011.
It is an interprime number because it is at equal distance from previous prime (110001011012173) and next prime (110001011012227).
It is a super-2 number, since 2×1100010110122002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 36172642680 + ... + 36172645720.
It is an arithmetic number, because the mean of its divisors is an integer number (442381526730).
Almost surely, 2110001011012200 is an apocalyptic number.
110001011012200 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 110001011012200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (169874506264320).
110001011012200 is an abundant number, since it is smaller than the sum of its proper divisors (229748001516440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110001011012200 is a wasteful number, since it uses less digits than its factorization.
110001011012200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3918 (or 3909 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 110001011012200 its reverse (2210110100011), we get a palindrome (112211121112211).
The spelling of 110001011012200 in words is "one hundred ten trillion, one billion, eleven million, twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •