| Base | Representation |
|---|---|
| bin | 11001000000101101011111… |
| … | …100001110010010010010100 |
| 3 | 112102110220020211120102120020 |
| 4 | 121000231133201302102110 |
| 5 | 103404220010042010400 |
| 6 | 1025541150152305140 |
| 7 | 32112144536455215 |
| oct | 3100553741622224 |
| 9 | 472426224512506 |
| 10 | 110000010110100 |
| 11 | 3205a819016050 |
| 12 | 104068a49a21b0 |
| 13 | 494bc58401176 |
| 14 | 1d2405941340c |
| 15 | cab54555d2a0 |
| hex | 640b5f872494 |
110000010110100 has 576 divisors, whose sum is σ = 361370370816000. Its totient is φ = 25589862144000.
The previous prime is 110000010110069. The next prime is 110000010110101. The reversal of 110000010110100 is 1011010000011.
110000010110100 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 not an unprimeable number, because it can be changed into a prime (110000010110101) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 21272480515 + ... + 21272485685.
It is an arithmetic number, because the mean of its divisors is an integer number (627379116000).
Almost surely, 2110000010110100 is an apocalyptic number.
110000010110100 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 110000010110100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (180685185408000).
110000010110100 is an abundant number, since it is smaller than the sum of its proper divisors (251370360705900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110000010110100 is a wasteful number, since it uses less digits than its factorization.
110000010110100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6544 (or 6537 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 110000010110100 its reverse (1011010000011), we get a palindrome (111011020110111).
The spelling of 110000010110100 in words is "one hundred ten trillion, ten million, one hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •