Base | Representation |
---|---|
bin | 1111100000101… |
… | …0110110100100 |
3 | 11112102012021120 |
4 | 3320022312210 |
5 | 113123244124 |
6 | 10242213540 |
7 | 1416653055 |
oct | 370126644 |
9 | 145365246 |
10 | 65056164 |
11 | 337a4728 |
12 | 199542b0 |
13 | 1062a494 |
14 | 88d672c |
15 | 5aa0d79 |
hex | 3e0ada4 |
65056164 has 48 divisors (see below), whose sum is σ = 159304320. Its totient is φ = 20634880.
The previous prime is 65056141. The next prime is 65056169. The reversal of 65056164 is 46165056.
65056164 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (65056169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23392 + ... + 26024.
It is an arithmetic number, because the mean of its divisors is an integer number (3318840).
Almost surely, 265056164 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 65056164, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (79652160).
65056164 is an abundant number, since it is smaller than the sum of its proper divisors (94248156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65056164 is a wasteful number, since it uses less digits than its factorization.
65056164 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2740 (or 2738 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 33.
The square root of 65056164 is about 8065.7401396276. The cubic root of 65056164 is about 402.1883476701.
The spelling of 65056164 in words is "sixty-five million, fifty-six thousand, one hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •