Base | Representation |
---|---|
bin | 111100110001100001… |
… | …0010010101111010101 |
3 | 110110212111122121012001 |
4 | 1321203002102233111 |
5 | 4114241201024214 |
6 | 135542234155301 |
7 | 12300113331016 |
oct | 1714302225725 |
9 | 413774577161 |
10 | 130510564309 |
11 | 503928a1704 |
12 | 21363882b31 |
13 | c3cb8b82a8 |
14 | 646121100d |
15 | 35dcab6c74 |
hex | 1e63092bd5 |
130510564309 has 2 divisors, whose sum is σ = 130510564310. Its totient is φ = 130510564308.
The previous prime is 130510564307. The next prime is 130510564321. The reversal of 130510564309 is 903465015031.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 112634072100 + 17876492209 = 335610^2 + 133703^2 .
It is an emirp because it is prime and its reverse (903465015031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130510564309 - 21 = 130510564307 is a prime.
Together with 130510564307, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130510564307) 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, 65255282154 + 65255282155.
It is an arithmetic number, because the mean of its divisors is an integer number (65255282155).
Almost surely, 2130510564309 is an apocalyptic number.
It is an amenable number.
130510564309 is a deficient number, since it is larger than the sum of its proper divisors (1).
130510564309 is an equidigital number, since it uses as much as digits as its factorization.
130510564309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48600, while the sum is 37.
The spelling of 130510564309 in words is "one hundred thirty billion, five hundred ten million, five hundred sixty-four thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •