Base | Representation |
---|---|
bin | 10110111101111001111011… |
… | …011000111011011111011111 |
3 | 111020122120100000001020102102 |
4 | 112331321323120323133133 |
5 | 101214431223404000111 |
6 | 554455510324315315 |
7 | 30163545331632341 |
oct | 2675717330733737 |
9 | 436576300036372 |
10 | 101011111000031 |
11 | 2a204631894921 |
12 | b3b4768842b3b |
13 | 44493cb3316cb |
14 | 1ad2d6cb81291 |
15 | ba27e66ee13b |
hex | 5bde7b63b7df |
101011111000031 has 2 divisors, whose sum is σ = 101011111000032. Its totient is φ = 101011111000030.
The previous prime is 101011110999979. The next prime is 101011111000081. The reversal of 101011111000031 is 130000111110101.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101011111000031 is a prime.
It is a super-2 number, since 2×1010111110000312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101011110999976 and 101011111000021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101011111000081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505555500015 + 50505555500016.
It is an arithmetic number, because the mean of its divisors is an integer number (50505555500016).
Almost surely, 2101011111000031 is an apocalyptic number.
101011111000031 is a deficient number, since it is larger than the sum of its proper divisors (1).
101011111000031 is an equidigital number, since it uses as much as digits as its factorization.
101011111000031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 11.
Adding to 101011111000031 its reverse (130000111110101), we get a palindrome (231011222110132).
The spelling of 101011111000031 in words is "one hundred one trillion, eleven billion, one hundred eleven million, thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •