Base | Representation |
---|---|
bin | 1111011101100… |
… | …0100101000001 |
3 | 11112000201210210 |
4 | 3313120211001 |
5 | 113100201431 |
6 | 10233544333 |
7 | 1415134521 |
oct | 367304501 |
9 | 145021723 |
10 | 64850241 |
11 | 33673a45 |
12 | 198750a9 |
13 | 10587831 |
14 | 8881681 |
15 | 5a5ed46 |
hex | 3dd8941 |
64850241 has 4 divisors (see below), whose sum is σ = 86466992. Its totient is φ = 43233492.
The previous prime is 64850237. The next prime is 64850243. The reversal of 64850241 is 14205846.
64850241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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.
It is not a de Polignac number, because 64850241 - 22 = 64850237 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 64850199 and 64850208.
It is not an unprimeable number, because it can be changed into a prime (64850243) 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 in 3 ways as a sum of consecutive naturals, for example, 10808371 + ... + 10808376.
It is an arithmetic number, because the mean of its divisors is an integer number (21616748).
Almost surely, 264850241 is an apocalyptic number.
It is an amenable number.
64850241 is a deficient number, since it is larger than the sum of its proper divisors (21616751).
64850241 is a wasteful number, since it uses less digits than its factorization.
64850241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21616750.
The product of its (nonzero) digits is 7680, while the sum is 30.
The square root of 64850241 is about 8052.9647335624. The cubic root of 64850241 is about 401.7635487297.
The spelling of 64850241 in words is "sixty-four million, eight hundred fifty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •