Base | Representation |
---|---|
bin | 10110111111010111001001… |
… | …001010100011011011011111 |
3 | 111021000010200101100102202011 |
4 | 112333113021022203123133 |
5 | 101223101214211231421 |
6 | 555013502153212051 |
7 | 30204020540153563 |
oct | 2677271112433337 |
9 | 437003611312664 |
10 | 101111200102111 |
11 | 2a243023548701 |
12 | b410040401027 |
13 | 445598c43a474 |
14 | 1ad7b459976a3 |
15 | ba52036894e1 |
hex | 5bf5c92a36df |
101111200102111 has 2 divisors, whose sum is σ = 101111200102112. Its totient is φ = 101111200102110.
The previous prime is 101111200102091. The next prime is 101111200102117. The reversal of 101111200102111 is 111201002111101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101111200102111 - 219 = 101111199577823 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101111200102091 and 101111200102100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101111200102117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50555600051055 + 50555600051056.
It is an arithmetic number, because the mean of its divisors is an integer number (50555600051056).
Almost surely, 2101111200102111 is an apocalyptic number.
101111200102111 is a deficient number, since it is larger than the sum of its proper divisors (1).
101111200102111 is an equidigital number, since it uses as much as digits as its factorization.
101111200102111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 101111200102111 its reverse (111201002111101), we get a palindrome (212312202213212).
The spelling of 101111200102111 in words is "one hundred one trillion, one hundred eleven billion, two hundred million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •