Base | Representation |
---|---|
bin | 1111011011010… |
… | …0111001111001 |
3 | 11111202022100221 |
4 | 3312310321321 |
5 | 113031012441 |
6 | 10230500041 |
7 | 1413655516 |
oct | 366647171 |
9 | 144668327 |
10 | 64704121 |
11 | 33584189 |
12 | 19804621 |
13 | 10536181 |
14 | 884430d |
15 | 5a318d1 |
hex | 3db4e79 |
64704121 has 4 divisors (see below), whose sum is σ = 66208912. Its totient is φ = 63199332.
The previous prime is 64704097. The next prime is 64704127. The reversal of 64704121 is 12140746.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 12140746 = 2 ⋅6070373.
It is a cyclic number.
It is not a de Polignac number, because 64704121 - 29 = 64703609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (64704127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 752331 + ... + 752416.
It is an arithmetic number, because the mean of its divisors is an integer number (16552228).
Almost surely, 264704121 is an apocalyptic number.
It is an amenable number.
64704121 is a deficient number, since it is larger than the sum of its proper divisors (1504791).
64704121 is a wasteful number, since it uses less digits than its factorization.
64704121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1504790.
The product of its (nonzero) digits is 1344, while the sum is 25.
The square root of 64704121 is about 8043.8871822024. The cubic root of 64704121 is about 401.4615717654.
Adding to 64704121 its reverse (12140746), we get a palindrome (76844867).
The spelling of 64704121 in words is "sixty-four million, seven hundred four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •