Base | Representation |
---|---|
bin | 1111011000110… |
… | …1000001010101 |
3 | 11111110000021102 |
4 | 3312031001111 |
5 | 113010301012 |
6 | 10223155445 |
7 | 1412405321 |
oct | 366150125 |
9 | 144400242 |
10 | 64540757 |
11 | 33482476 |
12 | 19745b85 |
13 | 104a99c8 |
14 | 8800981 |
15 | 59ed2c2 |
hex | 3d8d055 |
64540757 has 2 divisors, whose sum is σ = 64540758. Its totient is φ = 64540756.
The previous prime is 64540733. The next prime is 64540769. The reversal of 64540757 is 75704546.
64540757 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., 63266116 + 1274641 = 7954^2 + 1129^2 .
It is a cyclic number.
It is not a de Polignac number, because 64540757 - 222 = 60346453 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 64540757.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (64540787) 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, 32270378 + 32270379.
It is an arithmetic number, because the mean of its divisors is an integer number (32270379).
Almost surely, 264540757 is an apocalyptic number.
It is an amenable number.
64540757 is a deficient number, since it is larger than the sum of its proper divisors (1).
64540757 is an equidigital number, since it uses as much as digits as its factorization.
64540757 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 117600, while the sum is 38.
The square root of 64540757 is about 8033.7262213745. The cubic root of 64540757 is about 401.1234189541.
The spelling of 64540757 in words is "sixty-four million, five hundred forty thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •