Base | Representation |
---|---|
bin | 1111010001110… |
… | …1100001000000 |
3 | 11110120210202200 |
4 | 3310131201000 |
5 | 112401142112 |
6 | 10205313200 |
7 | 1405463625 |
oct | 364354100 |
9 | 143523680 |
10 | 64084032 |
11 | 331a0311 |
12 | 19565800 |
13 | 10379b5c |
14 | 872234c |
15 | 595ccdc |
hex | 3d1d840 |
64084032 has 84 divisors (see below), whose sum is σ = 186391296. Its totient is φ = 21047040.
The previous prime is 64084001. The next prime is 64084091. The reversal of 64084032 is 23048046.
It is a junction number, because it is equal to n+sod(n) for n = 64083987 and 64084005.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 40113 + ... + 41679.
It is an arithmetic number, because the mean of its divisors is an integer number (2218944).
Almost surely, 264084032 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 64084032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (93195648).
64084032 is an abundant number, since it is smaller than the sum of its proper divisors (122307264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64084032 is a wasteful number, since it uses less digits than its factorization.
64084032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1656 (or 1643 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
The square root of 64084032 is about 8005.2502771619. The cubic root of 64084032 is about 400.1749901017.
It can be divided in two parts, 6408 and 4032, that added together give a triangular number (10440 = T144).
The spelling of 64084032 in words is "sixty-four million, eighty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •