Base | Representation |
---|---|
bin | 1111100001011… |
… | …0001011100001 |
3 | 11112111112220222 |
4 | 3320112023201 |
5 | 113131240221 |
6 | 10243212425 |
7 | 1420235246 |
oct | 370261341 |
9 | 145445828 |
10 | 65102561 |
11 | 33826577 |
12 | 19977115 |
13 | 10645634 |
14 | 89095cd |
15 | 5aae9ab |
hex | 3e162e1 |
65102561 has 2 divisors, whose sum is σ = 65102562. Its totient is φ = 65102560.
The previous prime is 65102501. The next prime is 65102599. The reversal of 65102561 is 16520156.
65102561 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., 36372961 + 28729600 = 6031^2 + 5360^2 .
It is a cyclic number.
It is not a de Polignac number, because 65102561 - 222 = 60908257 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 65102561.
It is not a weakly prime, because it can be changed into another prime (65102501) 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, 32551280 + 32551281.
It is an arithmetic number, because the mean of its divisors is an integer number (32551281).
Almost surely, 265102561 is an apocalyptic number.
It is an amenable number.
65102561 is a deficient number, since it is larger than the sum of its proper divisors (1).
65102561 is an equidigital number, since it uses as much as digits as its factorization.
65102561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1800, while the sum is 26.
The square root of 65102561 is about 8068.6158044611. The cubic root of 65102561 is about 402.2839363497.
The spelling of 65102561 in words is "sixty-five million, one hundred two thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •