Base | Representation |
---|---|
bin | 11001000000101110100000… |
… | …100011101000001011000000 |
3 | 112102111000001212111001211000 |
4 | 121000232200203220023000 |
5 | 103404224223341041000 |
6 | 1025541450324252000 |
7 | 32112213555023610 |
oct | 3100564043501300 |
9 | 472430055431730 |
10 | 110001101112000 |
11 | 32060228944a0a |
12 | 10406b4a241000 |
13 | 494c0a0451317 |
14 | 1d2412028ca40 |
15 | cab5ab218000 |
hex | 640ba08e82c0 |
110001101112000 has 448 divisors, whose sum is σ = 461236369351680. Its totient is φ = 25143108480000.
The previous prime is 110001101111999. The next prime is 110001101112037. The reversal of 110001101112000 is 211101100011.
It is a tau number, because it is divible by the number of its divisors (448).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 34864026 + ... + 37888025.
Almost surely, 2110001101112000 is an apocalyptic number.
110001101112000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110001101112000 is an abundant number, since it is smaller than the sum of its proper divisors (351235268239680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110001101112000 is an equidigital number, since it uses as much as digits as its factorization.
110001101112000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72752094 (or 72752068 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 110001101112000 its reverse (211101100011), we get a palindrome (110212202212011).
The spelling of 110001101112000 in words is "one hundred ten trillion, one billion, one hundred one million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •