Base | Representation |
---|---|
bin | 111110100001010000… |
… | …011001101000100001 |
3 | 20102021101211022102002 |
4 | 332201100121220201 |
5 | 2044440231044023 |
6 | 50501123333345 |
7 | 4564354036166 |
oct | 764120315041 |
9 | 212241738362 |
10 | 67129940513 |
11 | 26519112989 |
12 | 11015821255 |
13 | 643a95a7bc |
14 | 336b79606d |
15 | 1b2d687b28 |
hex | fa1419a21 |
67129940513 has 2 divisors, whose sum is σ = 67129940514. Its totient is φ = 67129940512.
The previous prime is 67129940483. The next prime is 67129940531. The reversal of 67129940513 is 31504992176.
Together with next prime (67129940531) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 59103930769 + 8026009744 = 243113^2 + 89588^2 .
It is a cyclic number.
It is not a de Polignac number, because 67129940513 - 28 = 67129940257 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 (67119940513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33564970256 + 33564970257.
It is an arithmetic number, because the mean of its divisors is an integer number (33564970257).
Almost surely, 267129940513 is an apocalyptic number.
It is an amenable number.
67129940513 is a deficient number, since it is larger than the sum of its proper divisors (1).
67129940513 is an equidigital number, since it uses as much as digits as its factorization.
67129940513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 408240, while the sum is 47.
The spelling of 67129940513 in words is "sixty-seven billion, one hundred twenty-nine million, nine hundred forty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •