Base | Representation |
---|---|
bin | 10110101111010101100100… |
… | …100101110001010001011110 |
3 | 111010002212021221011120012021 |
4 | 112233111210211301101132 |
5 | 101102030440241010420 |
6 | 552411543225130354 |
7 | 30031325026156540 |
oct | 2657254445612136 |
9 | 433085257146167 |
10 | 100010001110110 |
11 | 2995900440a233 |
12 | b2727370299ba |
13 | 43a5b97131790 |
14 | 1a9a71d183690 |
15 | b867527eb7aa |
hex | 5af56497145e |
100010001110110 has 128 divisors (see below), whose sum is σ = 222537756672000. Its totient is φ = 31511985361920.
The previous prime is 100010001110099. The next prime is 100010001110137. The reversal of 100010001110110 is 11011100010001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a junction number, because it is equal to n+sod(n) for n = 100010001110093 and 100010001110102.
It is a congruent number.
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, 1011061555 + ... + 1011160465.
It is an arithmetic number, because the mean of its divisors is an integer number (1738576224000).
Almost surely, 2100010001110110 is an apocalyptic number.
100010001110110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100010001110110 is an abundant number, since it is smaller than the sum of its proper divisors (122527755561890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100010001110110 is a wasteful number, since it uses less digits than its factorization.
100010001110110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103826.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 100010001110110 its reverse (11011100010001), we get a palindrome (111021101120111).
The spelling of 100010001110110 in words is "one hundred trillion, ten billion, one million, one hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •