Base | Representation |
---|---|
bin | 11101110101001110011101… |
… | …000100100100000100100111 |
3 | 122012112200201100200010212201 |
4 | 131311032131010210010213 |
5 | 114144044122302211101 |
6 | 1143012524033555331 |
7 | 36430650055435525 |
oct | 3565163504440447 |
9 | 565480640603781 |
10 | 131201001210151 |
11 | 38894039864324 |
12 | 1286b771a15b47 |
13 | 5829280411b22 |
14 | 245823b66b315 |
15 | 1027c8c103e01 |
hex | 77539d124127 |
131201001210151 has 2 divisors, whose sum is σ = 131201001210152. Its totient is φ = 131201001210150.
The previous prime is 131201001210131. The next prime is 131201001210161. The reversal of 131201001210151 is 151012100102131.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (151012100102131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131201001210151 - 239 = 130651245396263 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131201001210131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65600500605075 + 65600500605076.
It is an arithmetic number, because the mean of its divisors is an integer number (65600500605076).
Almost surely, 2131201001210151 is an apocalyptic number.
131201001210151 is a deficient number, since it is larger than the sum of its proper divisors (1).
131201001210151 is an equidigital number, since it uses as much as digits as its factorization.
131201001210151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 19.
Adding to 131201001210151 its reverse (151012100102131), we get a palindrome (282213101312282).
The spelling of 131201001210151 in words is "one hundred thirty-one trillion, two hundred one billion, one million, two hundred ten thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •