Base | Representation |
---|---|
bin | 111100010011110101… |
… | …1001100001101100001 |
3 | 110101022002200001000222 |
4 | 1320213223030031201 |
5 | 4110221222340023 |
6 | 135255340252425 |
7 | 12233331245051 |
oct | 1704753141541 |
9 | 411262601028 |
10 | 129514652513 |
11 | 4aa21710404 |
12 | 21126241115 |
13 | c2a047cb7c |
14 | 63a8c49561 |
15 | 3580441cc8 |
hex | 1e27acc361 |
129514652513 has 2 divisors, whose sum is σ = 129514652514. Its totient is φ = 129514652512.
The previous prime is 129514652461. The next prime is 129514652549. The reversal of 129514652513 is 315256415921.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129145359424 + 369293089 = 359368^2 + 19217^2 .
It is a cyclic number.
It is not a de Polignac number, because 129514652513 - 210 = 129514651489 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (129514652563) 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, 64757326256 + 64757326257.
It is an arithmetic number, because the mean of its divisors is an integer number (64757326257).
Almost surely, 2129514652513 is an apocalyptic number.
It is an amenable number.
129514652513 is a deficient number, since it is larger than the sum of its proper divisors (1).
129514652513 is an equidigital number, since it uses as much as digits as its factorization.
129514652513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 324000, while the sum is 44.
The spelling of 129514652513 in words is "one hundred twenty-nine billion, five hundred fourteen million, six hundred fifty-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •