Base | Representation |
---|---|
bin | 1111011011101… |
… | …1100101011000 |
3 | 11111210200220020 |
4 | 3312323211120 |
5 | 113032401410 |
6 | 10231230440 |
7 | 1414131342 |
oct | 366734530 |
9 | 144720806 |
10 | 64731480 |
11 | 335a27a0 |
12 | 19818420 |
13 | 10545768 |
14 | 8850292 |
15 | 5a39a70 |
hex | 3dbb958 |
64731480 has 256 divisors, whose sum is σ = 233280000. Its totient is φ = 14192640.
The previous prime is 64731479. The next prime is 64731487. The reversal of 64731480 is 8413746.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64731487) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 727276 + ... + 727364.
It is an arithmetic number, because the mean of its divisors is an integer number (911250).
Almost surely, 264731480 is an apocalyptic number.
64731480 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 64731480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (116640000).
64731480 is an abundant number, since it is smaller than the sum of its proper divisors (168548520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64731480 is a wasteful number, since it uses less digits than its factorization.
64731480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 162 (or 158 counting only the distinct ones).
The product of its (nonzero) digits is 16128, while the sum is 33.
The square root of 64731480 is about 8045.5876106099. The cubic root of 64731480 is about 401.5181474479.
The spelling of 64731480 in words is "sixty-four million, seven hundred thirty-one thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •