Base | Representation |
---|---|
bin | 10110110000110011101000… |
… | …100101111101011001100101 |
3 | 111010110111222201101202220120 |
4 | 112300303220211331121211 |
5 | 101110204312000000401 |
6 | 552530205233552153 |
7 | 30041531622444006 |
oct | 2660635045753145 |
9 | 433414881352816 |
10 | 100111000000101 |
11 | 29997922680152 |
12 | b28a223415659 |
13 | 43b257188008c |
14 | 1aa1580b431ad |
15 | b891b4598836 |
hex | 5b0ce897d665 |
100111000000101 has 8 divisors (see below), whose sum is σ = 134500274809824. Its totient is φ = 66231195928560.
The previous prime is 100111000000097. The next prime is 100111000000181. The reversal of 100111000000101 is 101000000111001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100111000000101 - 22 = 100111000000097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100111000000101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100111000000181) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 127367684086 + ... + 127367684871.
It is an arithmetic number, because the mean of its divisors is an integer number (16812534351228).
Almost surely, 2100111000000101 is an apocalyptic number.
It is an amenable number.
100111000000101 is a deficient number, since it is larger than the sum of its proper divisors (34389274809723).
100111000000101 is a wasteful number, since it uses less digits than its factorization.
100111000000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254735369091.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 100111000000101 its reverse (101000000111001), we get a palindrome (201111000111102).
The spelling of 100111000000101 in words is "one hundred trillion, one hundred eleven billion, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •