Base | Representation |
---|---|
bin | 10110101111001100010111… |
… | …001010001100101011011111 |
3 | 111010001220202202020220110202 |
4 | 112233030113022030223133 |
5 | 101101400212144231421 |
6 | 552403230045254115 |
7 | 30030525000040454 |
oct | 2657142712145337 |
9 | 433056682226422 |
10 | 100000112102111 |
11 | 2995489a314151 |
12 | b27083726433b |
13 | 43a4c7c436060 |
14 | 1a9a061a7382b |
15 | b8637456510b |
hex | 5af31728cadf |
100000112102111 has 8 divisors (see below), whose sum is σ = 111405960432480. Its totient is φ = 89124768345312.
The previous prime is 100000112102041. The next prime is 100000112102129. The reversal of 100000112102111 is 111201211000001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100000112102111 - 234 = 99982932232927 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100000112102092 and 100000112102101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100000112102911) 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, 132626142995 + ... + 132626143748.
It is an arithmetic number, because the mean of its divisors is an integer number (13925745054060).
Almost surely, 2100000112102111 is an apocalyptic number.
100000112102111 is a deficient number, since it is larger than the sum of its proper divisors (11405848330369).
100000112102111 is a wasteful number, since it uses less digits than its factorization.
100000112102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 265252286785.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 100000112102111 its reverse (111201211000001), we get a palindrome (211201323102112).
The spelling of 100000112102111 in words is "one hundred trillion, one hundred twelve million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •