| Base | Representation |
|---|---|
| bin | 110011010001100010… |
| … | …1000101000011000000 |
| 3 | 101112012202202201100120 |
| 4 | 1212203011011003000 |
| 5 | 3301001202400000 |
| 6 | 122330043420240 |
| 7 | 10645430154153 |
| oct | 1464305050300 |
| 9 | 345182681316 |
| 10 | 110110200000 |
| 11 | 42774378a99 |
| 12 | 1940b824680 |
| 13 | a4ca2a22c8 |
| 14 | 5487aabc9a |
| 15 | 2ce6b146a0 |
| hex | 19a31450c0 |
110110200000 has 672 divisors, whose sum is σ = 388595128320. Its totient is φ = 27456000000.
The previous prime is 110110199981. The next prime is 110110200001. The reversal of 110110200000 is 2011011.
110110200000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1101102000002 (a number of 23 digits) contains 22 as substring.
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 not an unprimeable number, because it can be changed into a prime (110110200001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1090199950 + ... + 1090200050.
It is an arithmetic number, because the mean of its divisors is an integer number (578266560).
Almost surely, 2110110200000 is an apocalyptic number.
110110200000 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 110110200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (194297564160).
110110200000 is an abundant number, since it is smaller than the sum of its proper divisors (278484928320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110110200000 is an equidigital number, since it uses as much as digits as its factorization.
110110200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243 (or 213 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 110110200000 its reverse (2011011), we get a palindrome (110112211011).
The spelling of 110110200000 in words is "one hundred ten billion, one hundred ten million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •