| Base | Representation |
|---|---|
| bin | 11001011111011010100100… |
| … | …110010010011010101010000 |
| 3 | 112200221121111201200220220122 |
| 4 | 121133122210302103111100 |
| 5 | 104143302240224310000 |
| 6 | 1034234342400125412 |
| 7 | 32420452223262650 |
| oct | 3137324462232520 |
| 9 | 480847451626818 |
| 10 | 112110001010000 |
| 11 | 327a36479609a4 |
| 12 | 106a7804606868 |
| 13 | 4a72c0a2c7356 |
| 14 | 1d9821db98360 |
| 15 | ce6389937085 |
| hex | 65f6a4c93550 |
112110001010000 has 400 divisors, whose sum is σ = 326897699851008. Its totient is φ = 36402432000000.
The previous prime is 112110001009999. The next prime is 112110001010009. The reversal of 112110001010000 is 10100011211.
It is a happy number.
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 112110001010000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112110001010009) by changing a digit.
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 79 ways as a sum of consecutive naturals, for example, 162265280 + ... + 162954720.
Almost surely, 2112110001010000 is an apocalyptic number.
112110001010000 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 112110001010000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (163448849925504).
112110001010000 is an abundant number, since it is smaller than the sum of its proper divisors (214787698841008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112110001010000 is a wasteful number, since it uses less digits than its factorization.
112110001010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 689600 (or 689579 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 112110001010000 its reverse (10100011211), we get a palindrome (112120101021211).
The spelling of 112110001010000 in words is "one hundred twelve trillion, one hundred ten billion, one million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •