| Base | Representation |
|---|---|
| bin | 11001000000101101101010… |
| … | …110110111010111101000000 |
| 3 | 112102110220202002020222212220 |
| 4 | 121000231222312322331000 |
| 5 | 103404220402222400000 |
| 6 | 1025541221102451040 |
| 7 | 32112152335266165 |
| oct | 3100555266727500 |
| 9 | 472426662228786 |
| 10 | 110000200200000 |
| 11 | 3205a90634a440 |
| 12 | 10406938593a80 |
| 13 | 494bc888c87b6 |
| 14 | 1d2407677606c |
| 15 | cab5570ab1a0 |
| hex | 640b6adbaf40 |
110000200200000 has 672 divisors, whose sum is σ = 414105255567360. Its totient is φ = 25507257600000.
The previous prime is 110000200199999. The next prime is 110000200200017. The reversal of 110000200200000 is 2002000011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a congruent number.
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 95 ways as a sum of consecutive naturals, for example, 151437681 + ... + 152162319.
It is an arithmetic number, because the mean of its divisors is an integer number (616228058880).
Almost surely, 2110000200200000 is an apocalyptic number.
110000200200000 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 110000200200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (207052627783680).
110000200200000 is an abundant number, since it is smaller than the sum of its proper divisors (304105055367360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110000200200000 is an equidigital number, since it uses as much as digits as its factorization.
110000200200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 724713 (or 724683 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 6.
Adding to 110000200200000 its reverse (2002000011), we get a palindrome (110002202200011).
It can be divided in two parts, 1 and 10000200200000, that added together give a palindrome (10000200200001).
The spelling of 110000200200000 in words is "one hundred ten trillion, two hundred million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •