Base | Representation |
---|---|
bin | 101110100100001111… |
… | …0000111001011111000 |
3 | 100120010011211110221121 |
4 | 1131020132013023320 |
5 | 3114300011213422 |
6 | 113534525115024 |
7 | 10140044556202 |
oct | 1351036071370 |
9 | 316104743847 |
10 | 100000101112 |
11 | 394564a506a |
12 | 174699b8a74 |
13 | 9578846782 |
14 | 4ba9089772 |
15 | 29042598c7 |
hex | 17487872f8 |
100000101112 has 16 divisors (see below), whose sum is σ = 190678159800. Its totient is φ = 49152591840.
The previous prime is 100000101067. The next prime is 100000101151. The reversal of 100000101112 is 211101000001.
It is a junction number, because it is equal to n+sod(n) for n = 100000101095 and 100000101104.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 105931839 + ... + 105932782.
Almost surely, 2100000101112 is an apocalyptic number.
It is an amenable number.
100000101112 is a deficient number, since it is larger than the sum of its proper divisors (90678058688).
100000101112 is a wasteful number, since it uses less digits than its factorization.
100000101112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211864686 (or 211864682 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 100000101112 its reverse (211101000001), we get a palindrome (311101101113).
The spelling of 100000101112 in words is "one hundred billion, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •