Base | Representation |
---|---|
bin | 1111011110001… |
… | …1000011000000 |
3 | 11112002220121220 |
4 | 3313203003000 |
5 | 113103034440 |
6 | 10234515040 |
7 | 1415403525 |
oct | 367430300 |
9 | 145086556 |
10 | 64893120 |
11 | 336a3186 |
12 | 19895a80 |
13 | 105a11c6 |
14 | 889314c |
15 | 5a6c8d0 |
hex | 3de30c0 |
64893120 has 112 divisors (see below), whose sum is σ = 215066880. Its totient is φ = 16546816.
The previous prime is 64893109. The next prime is 64893121. The reversal of 64893120 is 2139846.
It is a super-2 number, since 2×648931202 = 8422234046668800, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (64893121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20611 + ... + 23549.
It is an arithmetic number, because the mean of its divisors is an integer number (1920240).
Almost surely, 264893120 is an apocalyptic number.
64893120 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 64893120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107533440).
64893120 is an abundant number, since it is smaller than the sum of its proper divisors (150173760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64893120 is a wasteful number, since it uses less digits than its factorization.
64893120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2982 (or 2972 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 33.
The square root of 64893120 is about 8055.6266050507. The cubic root of 64893120 is about 401.8520779495.
The spelling of 64893120 in words is "sixty-four million, eight hundred ninety-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •