Base | Representation |
---|---|
bin | 1111011000011… |
… | …1111000000000 |
3 | 11111101221100210 |
4 | 3312013320000 |
5 | 113004112210 |
6 | 10222514120 |
7 | 1412260011 |
oct | 366077000 |
9 | 144357323 |
10 | 64519680 |
11 | 33468655 |
12 | 19735940 |
13 | 104a0234 |
14 | 87d7008 |
15 | 59e6e20 |
hex | 3d87e00 |
64519680 has 160 divisors (see below), whose sum is σ = 213700608. Its totient is φ = 16588800.
The previous prime is 64519657. The next prime is 64519681. The reversal of 64519680 is 8691546.
It is a tau number, because it is divible by the number of its divisors (160).
It is a super-3 number, since 3×645196803 (a number of 24 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64519681) 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, 237945 + ... + 238215.
Almost surely, 264519680 is an apocalyptic number.
64519680 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 64519680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106850304).
64519680 is an abundant number, since it is smaller than the sum of its proper divisors (149180928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64519680 is a wasteful number, since it uses less digits than its factorization.
64519680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 328 (or 312 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 39.
The square root of 64519680 is about 8032.4143319428. The cubic root of 64519680 is about 401.0797493972.
The spelling of 64519680 in words is "sixty-four million, five hundred nineteen thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •