Base | Representation |
---|---|
bin | 10110110000110011101000… |
… | …101010001111010101000001 |
3 | 111010110111222210111210000120 |
4 | 112300303220222033111001 |
5 | 101110204312241401423 |
6 | 552530205314010453 |
7 | 30041531635126122 |
oct | 2660635052172501 |
9 | 433414883453016 |
10 | 100111001122113 |
11 | 29997923277133 |
12 | b28a223876a29 |
13 | 43b2571b839a7 |
14 | 1aa1580d56049 |
15 | b891b471aee3 |
hex | 5b0ce8a8f541 |
100111001122113 has 8 divisors (see below), whose sum is σ = 133481424086976. Its totient is φ = 66740622786000.
The previous prime is 100111001122091. The next prime is 100111001122129. The reversal of 100111001122113 is 311221100111001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100111001122113 - 217 = 100111000991041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100111001122092 and 100111001122101.
It is not an unprimeable number, because it can be changed into a prime (100111001122183) 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, 5515533 + ... + 15186938.
It is an arithmetic number, because the mean of its divisors is an integer number (16685178010872).
Almost surely, 2100111001122113 is an apocalyptic number.
It is an amenable number.
100111001122113 is a deficient number, since it is larger than the sum of its proper divisors (33370422964863).
100111001122113 is a wasteful number, since it uses less digits than its factorization.
100111001122113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22314375.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 100111001122113 its reverse (311221100111001), we get a palindrome (411332101233114).
The spelling of 100111001122113 in words is "one hundred trillion, one hundred eleven billion, one million, one hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •