Base | Representation |
---|---|
bin | 1111101001001… |
… | …1010011000001 |
3 | 11120110120220201 |
4 | 3322103103001 |
5 | 113244140131 |
6 | 10302205201 |
7 | 1424501332 |
oct | 372232301 |
9 | 146416821 |
10 | 65615041 |
11 | 34046608 |
12 | 19b83801 |
13 | 1079498b |
14 | 8a00289 |
15 | 5b61761 |
hex | 3e934c1 |
65615041 has 2 divisors, whose sum is σ = 65615042. Its totient is φ = 65615040.
The previous prime is 65614993. The next prime is 65615051. The reversal of 65615041 is 14051656.
65615041 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., 65610000 + 5041 = 8100^2 + 71^2 .
It is a cyclic number.
It is not a de Polignac number, because 65615041 - 29 = 65614529 is a prime.
It is not a weakly prime, because it can be changed into another prime (65615051) 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, 32807520 + 32807521.
It is an arithmetic number, because the mean of its divisors is an integer number (32807521).
Almost surely, 265615041 is an apocalyptic number.
It is an amenable number.
65615041 is a deficient number, since it is larger than the sum of its proper divisors (1).
65615041 is an equidigital number, since it uses as much as digits as its factorization.
65615041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 28.
The square root of 65615041 is about 8100.3111668627. The cubic root of 65615041 is about 403.3367564918.
Adding to 65615041 its reverse (14051656), we get a palindrome (79666697).
It can be divided in two parts, 6561 and 5041, that multiplied together give a square (33074001 = 57512).
The spelling of 65615041 in words is "sixty-five million, six hundred fifteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •