Base | Representation |
---|---|
bin | 1111010100010… |
… | …0100001011000 |
3 | 11110212220221000 |
4 | 3311010201120 |
5 | 112421300200 |
6 | 10212545000 |
7 | 1410030465 |
oct | 365044130 |
9 | 143786830 |
10 | 64243800 |
11 | 3329a355 |
12 | 19622160 |
13 | 104047aa |
14 | 876466c |
15 | 5990300 |
hex | 3d44858 |
64243800 has 96 divisors (see below), whose sum is σ = 221302800. Its totient is φ = 17130240.
The previous prime is 64243793. The next prime is 64243801. The reversal of 64243800 is 834246.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64243801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 549 + ... + 11348.
Almost surely, 264243800 is an apocalyptic number.
64243800 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 64243800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (110651400).
64243800 is an abundant number, since it is smaller than the sum of its proper divisors (157059000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64243800 is a wasteful number, since it uses less digits than its factorization.
64243800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11922 (or 11907 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
The square root of 64243800 is about 8015.2230162360. The cubic root of 64243800 is about 400.5072730798.
The spelling of 64243800 in words is "sixty-four million, two hundred forty-three thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •