Base | Representation |
---|---|
bin | 1111101010101… |
… | …0100000101001 |
3 | 11120122102100012 |
4 | 3322222200221 |
5 | 113310210441 |
6 | 10304221305 |
7 | 1425345461 |
oct | 372524051 |
9 | 146572305 |
10 | 65710121 |
11 | 34100a94 |
12 | 1a00a835 |
13 | 107c9039 |
14 | 8a26ba1 |
15 | 5b7e9eb |
hex | 3eaa829 |
65710121 has 2 divisors, whose sum is σ = 65710122. Its totient is φ = 65710120.
The previous prime is 65710097. The next prime is 65710123. The reversal of 65710121 is 12101756.
65710121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 55875625 + 9834496 = 7475^2 + 3136^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-65710121 is a prime.
Together with 65710123, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (65710123) 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, 32855060 + 32855061.
It is an arithmetic number, because the mean of its divisors is an integer number (32855061).
Almost surely, 265710121 is an apocalyptic number.
It is an amenable number.
65710121 is a deficient number, since it is larger than the sum of its proper divisors (1).
65710121 is an equidigital number, since it uses as much as digits as its factorization.
65710121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 420, while the sum is 23.
The square root of 65710121 is about 8106.1779526482. The cubic root of 65710121 is about 403.5314819170.
Adding to 65710121 its reverse (12101756), we get a palindrome (77811877).
The spelling of 65710121 in words is "sixty-five million, seven hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •