Base | Representation |
---|---|
bin | 1111010110001… |
… | …0000100100000 |
3 | 11111010001221200 |
4 | 3311202010200 |
5 | 112434133312 |
6 | 10215321200 |
7 | 1411043400 |
oct | 365420440 |
9 | 144101850 |
10 | 64364832 |
11 | 33372284 |
12 | 19680200 |
13 | 104478cc |
14 | 8796800 |
15 | 59b60dc |
hex | 3d62120 |
64364832 has 108 divisors (see below), whose sum is σ = 212967846. Its totient is φ = 18385920.
The previous prime is 64364809. The next prime is 64364857. The reversal of 64364832 is 23846346.
It is a happy number.
64364832 is a `hidden beast` number, since 6 + 4 + 3 + 648 + 3 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 58430736 + 5934096 = 7644^2 + 2436^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 11832 + ... + 16392.
Almost surely, 264364832 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 64364832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106483923).
64364832 is an abundant number, since it is smaller than the sum of its proper divisors (148603014).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64364832 is a wasteful number, since it uses less digits than its factorization.
64364832 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4591 (or 4573 counting only the distinct ones).
The product of its digits is 82944, while the sum is 36.
The square root of 64364832 is about 8022.7695965919. The cubic root of 64364832 is about 400.7586269699.
The spelling of 64364832 in words is "sixty-four million, three hundred sixty-four thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •