Base | Representation |
---|---|
bin | 111101000000001011… |
… | …0001101000010101001 |
3 | 110112010202222112110002 |
4 | 1322000112031002221 |
5 | 4121243043314423 |
6 | 140103122232345 |
7 | 12315234242114 |
oct | 1720026150251 |
9 | 415122875402 |
10 | 131002323113 |
11 | 5061543a342 |
12 | 214804b56b5 |
13 | c47974622c |
14 | 64aa65d57b |
15 | 361ad53228 |
hex | 1e8058d0a9 |
131002323113 has 2 divisors, whose sum is σ = 131002323114. Its totient is φ = 131002323112.
The previous prime is 131002323107. The next prime is 131002323131. The reversal of 131002323113 is 311323200131.
Together with next prime (131002323131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107454806809 + 23547516304 = 327803^2 + 153452^2 .
It is a cyclic number.
It is not a de Polignac number, because 131002323113 - 210 = 131002322089 is a prime.
It is a super-2 number, since 2×1310023231132 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131002323143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65501161556 + 65501161557.
It is an arithmetic number, because the mean of its divisors is an integer number (65501161557).
Almost surely, 2131002323113 is an apocalyptic number.
It is an amenable number.
131002323113 is a deficient number, since it is larger than the sum of its proper divisors (1).
131002323113 is an equidigital number, since it uses as much as digits as its factorization.
131002323113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 131002323113 its reverse (311323200131), we get a palindrome (442325523244).
The spelling of 131002323113 in words is "one hundred thirty-one billion, two million, three hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •