Base | Representation |
---|---|
bin | 10110101111001100010110… |
… | …011111110110001110101110 |
3 | 111010001220201222100212101112 |
4 | 112233030112133312032232 |
5 | 101101400201324000420 |
6 | 552403225011312022 |
7 | 30030524503501223 |
oct | 2657142637661656 |
9 | 433056658325345 |
10 | 100000101000110 |
11 | 29954894021043 |
12 | b2708335ab612 |
13 | 43a4c7a049a1c |
14 | 1a9a0603c394a |
15 | b863735c08c5 |
hex | 5af3167f63ae |
100000101000110 has 16 divisors (see below), whose sum is σ = 180005383688256. Its totient is φ = 39998884424928.
The previous prime is 100000101000071. The next prime is 100000101000131. The reversal of 100000101000110 is 11000101000001.
It is a Harshad number since it is a multiple of its sum of digits (5).
It is a junction number, because it is equal to n+sod(n) for n = 100000101000094 and 100000101000103.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 144133517 + ... + 144825656.
It is an arithmetic number, because the mean of its divisors is an integer number (11250336480516).
Almost surely, 2100000101000110 is an apocalyptic number.
100000101000110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100000101000110 is a deficient number, since it is larger than the sum of its proper divisors (80005282688146).
100000101000110 is a wasteful number, since it uses less digits than its factorization.
100000101000110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 288993787.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 100000101000110 its reverse (11000101000001), we get a palindrome (111000202000111).
The spelling of 100000101000110 in words is "one hundred trillion, one hundred one million, one hundred ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •