Base | Representation |
---|---|
bin | 1111010100011… |
… | …0101110000001 |
3 | 11110220101021101 |
4 | 3311012232001 |
5 | 112422042201 |
6 | 10213054401 |
7 | 1410065644 |
oct | 365065601 |
9 | 143811241 |
10 | 64252801 |
11 | 332a6098 |
12 | 19627401 |
13 | 10408912 |
14 | 8767a5b |
15 | 5992d01 |
hex | 3d46b81 |
64252801 has 8 divisors (see below), whose sum is σ = 67578624. Its totient is φ = 61005360.
The previous prime is 64252763. The next prime is 64252841. The reversal of 64252801 is 10825246.
64252801 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 64252801 - 219 = 63728513 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 64252801.
It is not an unprimeable number, because it can be changed into a prime (64252841) 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, 17911 + ... + 21196.
It is an arithmetic number, because the mean of its divisors is an integer number (8447328).
Almost surely, 264252801 is an apocalyptic number.
It is an amenable number.
64252801 is a deficient number, since it is larger than the sum of its proper divisors (3325823).
64252801 is a wasteful number, since it uses less digits than its factorization.
64252801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39191.
The product of its (nonzero) digits is 3840, while the sum is 28.
The square root of 64252801 is about 8015.7844906160. The cubic root of 64252801 is about 400.5259768178.
The spelling of 64252801 in words is "sixty-four million, two hundred fifty-two thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •