Base | Representation |
---|---|
bin | 1111011100000… |
… | …0101000000011 |
3 | 11111211202020002 |
4 | 3313000220003 |
5 | 113034032011 |
6 | 10231510215 |
7 | 1414245503 |
oct | 367005003 |
9 | 144752202 |
10 | 64752131 |
11 | 33607264 |
12 | 1982836b |
13 | 10551c92 |
14 | 8857a03 |
15 | 5a40c3b |
hex | 3dc0a03 |
64752131 has 2 divisors, whose sum is σ = 64752132. Its totient is φ = 64752130.
The previous prime is 64752101. The next prime is 64752137. The reversal of 64752131 is 13125746.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 64752131 - 26 = 64752067 is a prime.
It is a super-2 number, since 2×647521312 = 8385676938082322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 64752094 and 64752103.
It is not a weakly prime, because it can be changed into another prime (64752137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32376065 + 32376066.
It is an arithmetic number, because the mean of its divisors is an integer number (32376066).
Almost surely, 264752131 is an apocalyptic number.
64752131 is a deficient number, since it is larger than the sum of its proper divisors (1).
64752131 is an equidigital number, since it uses as much as digits as its factorization.
64752131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5040, while the sum is 29.
The square root of 64752131 is about 8046.8708825232. The cubic root of 64752131 is about 401.5608410990.
Adding to 64752131 its reverse (13125746), we get a palindrome (77877877).
The spelling of 64752131 in words is "sixty-four million, seven hundred fifty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •