Base | Representation |
---|---|
bin | 1111011000001… |
… | …1001011100001 |
3 | 11111100221222112 |
4 | 3312003023201 |
5 | 113003003244 |
6 | 10222245105 |
7 | 1412146646 |
oct | 366031341 |
9 | 144327875 |
10 | 64500449 |
11 | 33455162 |
12 | 19726795 |
13 | 10494560 |
14 | 87cddcd |
15 | 59e139e |
hex | 3d832e1 |
64500449 has 8 divisors (see below), whose sum is σ = 69640872. Its totient is φ = 59385600.
The previous prime is 64500409. The next prime is 64500463. The reversal of 64500449 is 94400546.
It is a happy number.
64500449 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 17372224 + 47128225 = 4168^2 + 6865^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 64500449 - 212 = 64496353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (64500409) 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 7 ways as a sum of consecutive naturals, for example, 974 + ... + 11399.
It is an arithmetic number, because the mean of its divisors is an integer number (8705109).
Almost surely, 264500449 is an apocalyptic number.
It is an amenable number.
64500449 is a deficient number, since it is larger than the sum of its proper divisors (5140423).
64500449 is a wasteful number, since it uses less digits than its factorization.
64500449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12787.
The product of its (nonzero) digits is 17280, while the sum is 32.
The square root of 64500449 is about 8031.2171555749. The cubic root of 64500449 is about 401.0398962799.
The spelling of 64500449 in words is "sixty-four million, five hundred thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •