Base | Representation |
---|---|
bin | 1111100000110… |
… | …0100011011001 |
3 | 11112102112211112 |
4 | 3320030203121 |
5 | 113124010004 |
6 | 10242310105 |
7 | 1420012265 |
oct | 370144331 |
9 | 145375745 |
10 | 65063129 |
11 | 337a998a |
12 | 19958335 |
13 | 106306c1 |
14 | 88d90a5 |
15 | 5aa2e6e |
hex | 3e0c8d9 |
65063129 has 2 divisors, whose sum is σ = 65063130. Its totient is φ = 65063128.
The previous prime is 65063123. The next prime is 65063137. The reversal of 65063129 is 92136056.
It is a happy number.
65063129 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 62094400 + 2968729 = 7880^2 + 1723^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-65063129 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 65063095 and 65063104.
It is not a weakly prime, because it can be changed into another prime (65063123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32531564 + 32531565.
It is an arithmetic number, because the mean of its divisors is an integer number (32531565).
Almost surely, 265063129 is an apocalyptic number.
It is an amenable number.
65063129 is a deficient number, since it is larger than the sum of its proper divisors (1).
65063129 is an equidigital number, since it uses as much as digits as its factorization.
65063129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 32.
The square root of 65063129 is about 8066.1718925399. The cubic root of 65063129 is about 402.2027000989.
The spelling of 65063129 in words is "sixty-five million, sixty-three thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •