Base | Representation |
---|---|
bin | 10110101111001100010111… |
… | …000110000000110110101101 |
3 | 111010001220202200012011122202 |
4 | 112233030113012000312231 |
5 | 101101400211404130401 |
6 | 552403230005551245 |
7 | 30030524654521256 |
oct | 2657142706006655 |
9 | 433056680164582 |
10 | 100000111005101 |
11 | 29954899734a2a |
12 | b270836a15525 |
13 | 43a4c7c140938 |
14 | 1a9a061869b2d |
15 | b863743ea06b |
hex | 5af317180dad |
100000111005101 has 2 divisors, whose sum is σ = 100000111005102. Its totient is φ = 100000111005100.
The previous prime is 100000111005097. The next prime is 100000111005103. The reversal of 100000111005101 is 101500111000001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88475206327876 + 11524904677225 = 9406126^2 + 3394835^2 .
It is a cyclic number.
It is not a de Polignac number, because 100000111005101 - 22 = 100000111005097 is a prime.
Together with 100000111005103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100000111005103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000055502550 + 50000055502551.
It is an arithmetic number, because the mean of its divisors is an integer number (50000055502551).
Almost surely, 2100000111005101 is an apocalyptic number.
It is an amenable number.
100000111005101 is a deficient number, since it is larger than the sum of its proper divisors (1).
100000111005101 is an equidigital number, since it uses as much as digits as its factorization.
100000111005101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5, while the sum is 11.
Adding to 100000111005101 its reverse (101500111000001), we get a palindrome (201500222005102).
The spelling of 100000111005101 in words is "one hundred trillion, one hundred eleven million, five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •