| Base | Representation |
|---|---|
| bin | 11001000000101110100110… |
| … | …011101101010000001010000 |
| 3 | 112102111000022202221202201022 |
| 4 | 121000232212131222001100 |
| 5 | 103404224424223210000 |
| 6 | 1025541504224255012 |
| 7 | 32112216200241221 |
| oct | 3100564635520120 |
| 9 | 472430282852638 |
| 10 | 110001200210000 |
| 11 | 3206027987a790 |
| 12 | 10406b77471468 |
| 13 | 494c0b7b3a3a8 |
| 14 | 1d2412d4c7248 |
| 15 | cab5b4c90585 |
| hex | 640ba676a050 |
110001200210000 has 400 divisors, whose sum is σ = 291752350612800. Its totient is φ = 39833164800000.
The previous prime is 110001200209961. The next prime is 110001200210047. The reversal of 110001200210000 is 12002100011.
It is a tau number, because it is divible by the number of its divisors (400).
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a self number, because there is not a number n which added to its sum of digits gives 110001200210000.
It is a congruent number.
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 79 ways as a sum of consecutive naturals, for example, 54214488986 + ... + 54214491014.
It is an arithmetic number, because the mean of its divisors is an integer number (729380876532).
Almost surely, 2110001200210000 is an apocalyptic number.
110001200210000 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 110001200210000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (145876175306400).
110001200210000 is an abundant number, since it is smaller than the sum of its proper divisors (181751150402800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110001200210000 is a wasteful number, since it uses less digits than its factorization.
110001200210000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3888 (or 3867 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 110001200210000 its reverse (12002100011), we get a palindrome (110013202310011).
It can be divided in two parts, 1 and 10001200210000, that added together give a palindrome (10001200210001).
The spelling of 110001200210000 in words is "one hundred ten trillion, one billion, two hundred million, two hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •