Base | Representation |
---|---|
bin | 10110111111011111011011… |
… | …101001000000110001100111 |
3 | 111021000222122122002122201102 |
4 | 112333133123221000301213 |
5 | 101223222431100323421 |
6 | 555021533241150315 |
7 | 30204454226143256 |
oct | 2677373351006147 |
9 | 437028578078642 |
10 | 101120100011111 |
11 | 2a246880295aa5 |
12 | b411904a8b39b |
13 | 445677a2446cc |
14 | 1ad834b99679d |
15 | ba5574b9460b |
hex | 5bf7dba40c67 |
101120100011111 has 2 divisors, whose sum is σ = 101120100011112. Its totient is φ = 101120100011110.
The previous prime is 101120100011101. The next prime is 101120100011113. The reversal of 101120100011111 is 111110001021101.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101120100011111 - 210 = 101120100010087 is a prime.
Together with 101120100011113, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 101120100011092 and 101120100011101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101120100011113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50560050005555 + 50560050005556.
It is an arithmetic number, because the mean of its divisors is an integer number (50560050005556).
Almost surely, 2101120100011111 is an apocalyptic number.
101120100011111 is a deficient number, since it is larger than the sum of its proper divisors (1).
101120100011111 is an equidigital number, since it uses as much as digits as its factorization.
101120100011111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 101120100011111 its reverse (111110001021101), we get a palindrome (212230101032212).
The spelling of 101120100011111 in words is "one hundred one trillion, one hundred twenty billion, one hundred million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •