Base | Representation |
---|---|
bin | 111100001100001001… |
… | …0110001111001110011 |
3 | 110100122010002100202111 |
4 | 1320120102301321303 |
5 | 4104204142020214 |
6 | 135214001230151 |
7 | 12224045634004 |
oct | 1703022617163 |
9 | 410563070674 |
10 | 129256595059 |
11 | 4a8a9a83a89 |
12 | 21073932357 |
13 | c25bb78b57 |
14 | 63828731ab |
15 | 356796a5c4 |
hex | 1e184b1e73 |
129256595059 has 2 divisors, whose sum is σ = 129256595060. Its totient is φ = 129256595058.
The previous prime is 129256595021. The next prime is 129256595071. The reversal of 129256595059 is 950595652921.
It is a strong prime.
It is an emirp because it is prime and its reverse (950595652921) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 129256595059 - 215 = 129256562291 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 129256594994 and 129256595012.
It is not a weakly prime, because it can be changed into another prime (129256595089) 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, 64628297529 + 64628297530.
It is an arithmetic number, because the mean of its divisors is an integer number (64628297530).
Almost surely, 2129256595059 is an apocalyptic number.
129256595059 is a deficient number, since it is larger than the sum of its proper divisors (1).
129256595059 is an equidigital number, since it uses as much as digits as its factorization.
129256595059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10935000, while the sum is 58.
The spelling of 129256595059 in words is "one hundred twenty-nine billion, two hundred fifty-six million, five hundred ninety-five thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •