Base | Representation |
---|---|
bin | 1111100011000… |
… | …1101110000001 |
3 | 11112201021122202 |
4 | 3320301232001 |
5 | 113143342421 |
6 | 10245442545 |
7 | 1421215151 |
oct | 370615601 |
9 | 145637582 |
10 | 65215361 |
11 | 338a32a2 |
12 | 19a10455 |
13 | 10684a93 |
14 | 8938761 |
15 | 5ad310b |
hex | 3e31b81 |
65215361 has 2 divisors, whose sum is σ = 65215362. Its totient is φ = 65215360.
The previous prime is 65215357. The next prime is 65215393. The reversal of 65215361 is 16351256.
65215361 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., 45144961 + 20070400 = 6719^2 + 4480^2 .
It is a cyclic number.
It is not a de Polignac number, because 65215361 - 22 = 65215357 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (65215301) 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, 32607680 + 32607681.
It is an arithmetic number, because the mean of its divisors is an integer number (32607681).
Almost surely, 265215361 is an apocalyptic number.
It is an amenable number.
65215361 is a deficient number, since it is larger than the sum of its proper divisors (1).
65215361 is an equidigital number, since it uses as much as digits as its factorization.
65215361 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5400, while the sum is 29.
The square root of 65215361 is about 8075.6028257957. The cubic root of 65215361 is about 402.5161414768.
The spelling of 65215361 in words is "sixty-five million, two hundred fifteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •