Base | Representation |
---|---|
bin | 11101101000010100111000… |
… | …101001111011010101111001 |
3 | 122002101221122021102122210222 |
4 | 131220110320221323111321 |
5 | 114040033201112234001 |
6 | 1141053402421345425 |
7 | 36306626053152041 |
oct | 3550247051732571 |
9 | 562357567378728 |
10 | 130314553243001 |
11 | 38582101015386 |
12 | 12747a00268275 |
13 | 57937c04ca28a |
14 | 242738806c721 |
15 | 100eba971e61b |
hex | 768538a7b579 |
130314553243001 has 2 divisors, whose sum is σ = 130314553243002. Its totient is φ = 130314553243000.
The previous prime is 130314553242949. The next prime is 130314553243003. The reversal of 130314553243001 is 100342355413031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109776979457401 + 20537573785600 = 10477451^2 + 4531840^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130314553243001 is a prime.
It is a Sophie Germain prime.
Together with 130314553243003, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (130314553243003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65157276621500 + 65157276621501.
It is an arithmetic number, because the mean of its divisors is an integer number (65157276621501).
Almost surely, 2130314553243001 is an apocalyptic number.
It is an amenable number.
130314553243001 is a deficient number, since it is larger than the sum of its proper divisors (1).
130314553243001 is an equidigital number, since it uses as much as digits as its factorization.
130314553243001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64800, while the sum is 35.
The spelling of 130314553243001 in words is "one hundred thirty trillion, three hundred fourteen billion, five hundred fifty-three million, two hundred forty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •