Base | Representation |
---|---|
bin | 10110101111001101010011… |
… | …001111000001100001101111 |
3 | 111010002000100222210102121022 |
4 | 112233031103033001201233 |
5 | 101101404243210000421 |
6 | 552403514052124355 |
7 | 30030561656034551 |
oct | 2657152317014157 |
9 | 433060328712538 |
10 | 100001120000111 |
11 | 29955267241900 |
12 | b270a789066bb |
13 | 43a50b01aa0c5 |
14 | 1a9a1198794d1 |
15 | b863d2ca67ab |
hex | 5af3533c186f |
100001120000111 has 24 divisors (see below), whose sum is σ = 111019344132144. Its totient is φ = 89999910000000.
The previous prime is 100001120000087. The next prime is 100001120000123. The reversal of 100001120000111 is 111000021100001.
It is a happy number.
It is not a de Polignac number, because 100001120000111 - 222 = 100001115805807 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100001120000311) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 109546676 + ... + 110455766.
It is an arithmetic number, because the mean of its divisors is an integer number (4625806005506).
Almost surely, 2100001120000111 is an apocalyptic number.
100001120000111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100001120000111 is a deficient number, since it is larger than the sum of its proper divisors (11018224132033).
100001120000111 is a wasteful number, since it uses less digits than its factorization.
100001120000111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 918215 (or 918204 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 100001120000111 its reverse (111000021100001), we get a palindrome (211001141100112).
The spelling of 100001120000111 in words is "one hundred trillion, one billion, one hundred twenty million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •