Base | Representation |
---|---|
bin | 1111011001110… |
… | …1110110011100 |
3 | 11111120111211120 |
4 | 3312131312130 |
5 | 113020002232 |
6 | 10224450540 |
7 | 1413113310 |
oct | 366356634 |
9 | 144514746 |
10 | 64609692 |
11 | 3351a244 |
12 | 19779a50 |
13 | 105021b4 |
14 | 881bb40 |
15 | 5a1392c |
hex | 3d9dd9c |
64609692 has 48 divisors (see below), whose sum is σ = 173295360. Its totient is φ = 18352512.
The previous prime is 64609669. The next prime is 64609697. The reversal of 64609692 is 29690646.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64609697) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12888 + ... + 17184.
It is an arithmetic number, because the mean of its divisors is an integer number (3610320).
Almost surely, 264609692 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 64609692, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (86647680).
64609692 is an abundant number, since it is smaller than the sum of its proper divisors (108685668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64609692 is a wasteful number, since it uses less digits than its factorization.
64609692 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4490 (or 4488 counting only the distinct ones).
The product of its (nonzero) digits is 139968, while the sum is 42.
The square root of 64609692 is about 8038.0154267083. The cubic root of 64609692 is about 401.2661794118.
The spelling of 64609692 in words is "sixty-four million, six hundred nine thousand, six hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •