Base | Representation |
---|---|
bin | 111101000000001011… |
… | …0000111011011001111 |
3 | 110112010202221100220011 |
4 | 1322000112013123033 |
5 | 4121243042100421 |
6 | 140103121534051 |
7 | 12315234115054 |
oct | 1720026073317 |
9 | 415122840804 |
10 | 131002300111 |
11 | 50615424031 |
12 | 214804a4327 |
13 | c479738917 |
14 | 64aa65502b |
15 | 361ad4b4e1 |
hex | 1e805876cf |
131002300111 has 2 divisors, whose sum is σ = 131002300112. Its totient is φ = 131002300110.
The previous prime is 131002300109. The next prime is 131002300127. The reversal of 131002300111 is 111003200131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 131002300111 - 21 = 131002300109 is a prime.
It is a super-2 number, since 2×1310023001112 (a number of 23 digits) contains 22 as substring.
Together with 131002300109, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 131002300091 and 131002300100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131002300141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65501150055 + 65501150056.
It is an arithmetic number, because the mean of its divisors is an integer number (65501150056).
Almost surely, 2131002300111 is an apocalyptic number.
131002300111 is a deficient number, since it is larger than the sum of its proper divisors (1).
131002300111 is an equidigital number, since it uses as much as digits as its factorization.
131002300111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 131002300111 its reverse (111003200131), we get a palindrome (242005500242).
The spelling of 131002300111 in words is "one hundred thirty-one billion, two million, three hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •