Base | Representation |
---|---|
bin | 1111100001011… |
… | …0110010100001 |
3 | 11112111200100102 |
4 | 3320112302201 |
5 | 113131330212 |
6 | 10243232145 |
7 | 1420245443 |
oct | 370266241 |
9 | 145450312 |
10 | 65105057 |
11 | 33828436 |
12 | 19978655 |
13 | 10646804 |
14 | 890a493 |
15 | 5ab05c2 |
hex | 3e16ca1 |
65105057 has 2 divisors, whose sum is σ = 65105058. Its totient is φ = 65105056.
The previous prime is 65105023. The next prime is 65105069. The reversal of 65105057 is 75050156.
65105057 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., 44302336 + 20802721 = 6656^2 + 4561^2 .
It is a cyclic number.
It is not a de Polignac number, because 65105057 - 26 = 65104993 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (65125057) 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, 32552528 + 32552529.
It is an arithmetic number, because the mean of its divisors is an integer number (32552529).
Almost surely, 265105057 is an apocalyptic number.
It is an amenable number.
65105057 is a deficient number, since it is larger than the sum of its proper divisors (1).
65105057 is an equidigital number, since it uses as much as digits as its factorization.
65105057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5250, while the sum is 29.
The square root of 65105057 is about 8068.7704763489. The cubic root of 65105057 is about 402.2890774064.
The spelling of 65105057 in words is "sixty-five million, one hundred five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •