Base | Representation |
---|---|
bin | 1111011100011… |
… | …1101111000000 |
3 | 11111220020011111 |
4 | 3313013233000 |
5 | 113040444443 |
6 | 10232253104 |
7 | 1414426420 |
oct | 367075700 |
9 | 144806144 |
10 | 64781248 |
11 | 33627124 |
12 | 19841194 |
13 | 105622cc |
14 | 8864480 |
15 | 5a4969d |
hex | 3dc7bc0 |
64781248 has 56 divisors (see below), whose sum is σ = 153326592. Its totient is φ = 26552064.
The previous prime is 64781243. The next prime is 64781257. The reversal of 64781248 is 84218746.
It is a tau number, because it is divible by the number of its divisors (56).
It is a super-2 number, since 2×647812482 = 8393220184875008, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 64781248.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64781243) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7161 + ... + 13447.
Almost surely, 264781248 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 64781248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76663296).
64781248 is an abundant number, since it is smaller than the sum of its proper divisors (88545344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64781248 is a wasteful number, since it uses less digits than its factorization.
64781248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6329 (or 6319 counting only the distinct ones).
The product of its digits is 86016, while the sum is 40.
The square root of 64781248 is about 8048.6798917586. The cubic root of 64781248 is about 401.6210218463.
The spelling of 64781248 in words is "sixty-four million, seven hundred eighty-one thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •