Base | Representation |
---|---|
bin | 1111100010110… |
… | …0000010000000 |
3 | 11112200002200220 |
4 | 3320230002000 |
5 | 113142121224 |
6 | 10245143040 |
7 | 1421060220 |
oct | 370540200 |
9 | 145602626 |
10 | 65192064 |
11 | 33887843 |
12 | 199baa80 |
13 | 106772b2 |
14 | 8930080 |
15 | 5acb279 |
hex | 3e2c080 |
65192064 has 128 divisors (see below), whose sum is σ = 201062400. Its totient is φ = 18330624.
The previous prime is 65192063. The next prime is 65192069. The reversal of 65192064 is 46029156.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (65192063) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 212199 + ... + 212505.
It is an arithmetic number, because the mean of its divisors is an integer number (1570800).
Almost surely, 265192064 is an apocalyptic number.
65192064 is a gapful number since it is divisible by the number (64) 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 65192064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100531200).
65192064 is an abundant number, since it is smaller than the sum of its proper divisors (135870336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65192064 is a wasteful number, since it uses less digits than its factorization.
65192064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410 (or 398 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 33.
The square root of 65192064 is about 8074.1602659348. The cubic root of 65192064 is about 402.4682052480.
The spelling of 65192064 in words is "sixty-five million, one hundred ninety-two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •