Base | Representation |
---|---|
bin | 111100101000010111… |
… | …0010101000110010001 |
3 | 110110002002120001022102 |
4 | 1321100232111012101 |
5 | 4113124023404301 |
6 | 135451541250145 |
7 | 12256363065563 |
oct | 1712056250621 |
9 | 413062501272 |
10 | 130203341201 |
11 | 5024543440a |
12 | 21298a03955 |
13 | c38005b87b |
14 | 64324bb333 |
15 | 35c0b2cb6b |
hex | 1e50b95191 |
130203341201 has 2 divisors, whose sum is σ = 130203341202. Its totient is φ = 130203341200.
The previous prime is 130203341167. The next prime is 130203341221. The reversal of 130203341201 is 102143302031.
It is an a-pointer prime, because the next prime (130203341221) can be obtained adding 130203341201 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110540290576 + 19663050625 = 332476^2 + 140225^2 .
It is a cyclic number.
It is not a de Polignac number, because 130203341201 - 214 = 130203324817 is a prime.
It is not a weakly prime, because it can be changed into another prime (130203341221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65101670600 + 65101670601.
It is an arithmetic number, because the mean of its divisors is an integer number (65101670601).
Almost surely, 2130203341201 is an apocalyptic number.
It is an amenable number.
130203341201 is a deficient number, since it is larger than the sum of its proper divisors (1).
130203341201 is an equidigital number, since it uses as much as digits as its factorization.
130203341201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 130203341201 its reverse (102143302031), we get a palindrome (232346643232).
The spelling of 130203341201 in words is "one hundred thirty billion, two hundred three million, three hundred forty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •