Base | Representation |
---|---|
bin | 11101110110110100111111… |
… | …011110111000010101110011 |
3 | 122012221012220100100100012212 |
4 | 131312310333132320111303 |
5 | 114202400113122402212 |
6 | 1143135253041242335 |
7 | 36441625321424156 |
oct | 3566647736702563 |
9 | 565835810310185 |
10 | 131311100200307 |
11 | 389267a7876185 |
12 | 12888b799333ab |
13 | 583677828a991 |
14 | 245d6c3a5bc9d |
15 | 102aa82c51e22 |
hex | 776d3f7b8573 |
131311100200307 has 2 divisors, whose sum is σ = 131311100200308. Its totient is φ = 131311100200306.
The previous prime is 131311100200277. The next prime is 131311100200337. The reversal of 131311100200307 is 703002001113131.
It is a balanced prime because it is at equal distance from previous prime (131311100200277) and next prime (131311100200337).
It is a cyclic number.
It is not a de Polignac number, because 131311100200307 - 26 = 131311100200243 is a prime.
It is not a weakly prime, because it can be changed into another prime (131311100200337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65655550100153 + 65655550100154.
It is an arithmetic number, because the mean of its divisors is an integer number (65655550100154).
Almost surely, 2131311100200307 is an apocalyptic number.
131311100200307 is a deficient number, since it is larger than the sum of its proper divisors (1).
131311100200307 is an equidigital number, since it uses as much as digits as its factorization.
131311100200307 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 378, while the sum is 23.
Adding to 131311100200307 its reverse (703002001113131), we get a palindrome (834313101313438).
The spelling of 131311100200307 in words is "one hundred thirty-one trillion, three hundred eleven billion, one hundred million, two hundred thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •