Base | Representation |
---|---|
bin | 1111100000110… |
… | …0110110000000 |
3 | 11112102121110122 |
4 | 3320030312000 |
5 | 113124024240 |
6 | 10242315412 |
7 | 1420015616 |
oct | 370146600 |
9 | 145377418 |
10 | 65064320 |
11 | 337aa872 |
12 | 19958b68 |
13 | 106310c9 |
14 | 88d96b6 |
15 | 5aa34b5 |
hex | 3e0cd80 |
65064320 has 32 divisors (see below), whose sum is σ = 155545920. Its totient is φ = 26025472.
The previous prime is 65064317. The next prime is 65064323. The reversal of 65064320 is 2346056.
It is an interprime number because it is at equal distance from previous prime (65064317) and next prime (65064323).
It is a tau number, because it is divible by the number of its divisors (32).
It is a self number, because there is not a number n which added to its sum of digits gives 65064320.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (65064323) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 50192 + ... + 51471.
It is an arithmetic number, because the mean of its divisors is an integer number (4860810).
Almost surely, 265064320 is an apocalyptic number.
It is an amenable number.
65064320 is an abundant number, since it is smaller than the sum of its proper divisors (90481600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65064320 is a wasteful number, since it uses less digits than its factorization.
65064320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101682 (or 101670 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 26.
The square root of 65064320 is about 8066.2457190443. The cubic root of 65064320 is about 402.2051542308.
The spelling of 65064320 in words is "sixty-five million, sixty-four thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •