Base | Representation |
---|---|
bin | 111100110010110000… |
… | …1100011011010101001 |
3 | 110110222102012200022212 |
4 | 1321211201203122221 |
5 | 4114332343013023 |
6 | 135550325054505 |
7 | 12301131232556 |
oct | 1714541433251 |
9 | 413872180285 |
10 | 130552313513 |
11 | 50404417486 |
12 | 21375857435 |
13 | c40744506b |
14 | 646699ba2d |
15 | 35e15b1e78 |
hex | 1e658636a9 |
130552313513 has 2 divisors, whose sum is σ = 130552313514. Its totient is φ = 130552313512.
The previous prime is 130552313449. The next prime is 130552313519. The reversal of 130552313513 is 315313255031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109449812224 + 21102501289 = 330832^2 + 145267^2 .
It is a cyclic number.
It is not a de Polignac number, because 130552313513 - 26 = 130552313449 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130552313513.
It is not a weakly prime, because it can be changed into another prime (130552313519) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65276156756 + 65276156757.
It is an arithmetic number, because the mean of its divisors is an integer number (65276156757).
Almost surely, 2130552313513 is an apocalyptic number.
It is an amenable number.
130552313513 is a deficient number, since it is larger than the sum of its proper divisors (1).
130552313513 is an equidigital number, since it uses as much as digits as its factorization.
130552313513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20250, while the sum is 32.
Adding to 130552313513 its reverse (315313255031), we get a palindrome (445865568544).
The spelling of 130552313513 in words is "one hundred thirty billion, five hundred fifty-two million, three hundred thirteen thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •