Base | Representation |
---|---|
bin | 1111011100001… |
… | …0100101000011 |
3 | 11111212011012101 |
4 | 3313002211003 |
5 | 113034311011 |
6 | 10232011231 |
7 | 1414311022 |
oct | 367024503 |
9 | 144764171 |
10 | 64760131 |
11 | 33612277 |
12 | 19830b17 |
13 | 10555807 |
14 | 885a8b9 |
15 | 5a432c1 |
hex | 3dc2943 |
64760131 has 2 divisors, whose sum is σ = 64760132. Its totient is φ = 64760130.
The previous prime is 64760083. The next prime is 64760141. The reversal of 64760131 is 13106746.
64760131 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 is a cyclic number.
It is not a de Polignac number, because 64760131 - 221 = 62662979 is a prime.
It is a super-2 number, since 2×647601312 = 8387749134274322, which contains 22 as substring.
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 64760131.
It is not a weakly prime, because it can be changed into another prime (64760141) 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, 32380065 + 32380066.
It is an arithmetic number, because the mean of its divisors is an integer number (32380066).
Almost surely, 264760131 is an apocalyptic number.
64760131 is a deficient number, since it is larger than the sum of its proper divisors (1).
64760131 is an equidigital number, since it uses as much as digits as its factorization.
64760131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 28.
The square root of 64760131 is about 8047.3679548036. The cubic root of 64760131 is about 401.5773777719.
Adding to 64760131 its reverse (13106746), we get a palindrome (77866877).
The spelling of 64760131 in words is "sixty-four million, seven hundred sixty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •