Base | Representation |
---|---|
bin | 111100110000000000… |
… | …1001101101110111101 |
3 | 110110201222102010102111 |
4 | 1321200001031232331 |
5 | 4114140221400023 |
6 | 135533225254021 |
7 | 12265630164331 |
oct | 1714001155675 |
9 | 413658363374 |
10 | 130459950013 |
11 | 50367271408 |
12 | 2134a934311 |
13 | c3c12763c3 |
14 | 64585d77c1 |
15 | 35d841a00d |
hex | 1e6004dbbd |
130459950013 has 2 divisors, whose sum is σ = 130459950014. Its totient is φ = 130459950012.
The previous prime is 130459949993. The next prime is 130459950017. The reversal of 130459950013 is 310059954031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109516650489 + 20943299524 = 330933^2 + 144718^2 .
It is a cyclic number.
It is not a de Polignac number, because 130459950013 - 25 = 130459949981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130459950017) 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, 65229975006 + 65229975007.
It is an arithmetic number, because the mean of its divisors is an integer number (65229975007).
Almost surely, 2130459950013 is an apocalyptic number.
It is an amenable number.
130459950013 is a deficient number, since it is larger than the sum of its proper divisors (1).
130459950013 is an equidigital number, since it uses as much as digits as its factorization.
130459950013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72900, while the sum is 40.
The spelling of 130459950013 in words is "one hundred thirty billion, four hundred fifty-nine million, nine hundred fifty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •