Base | Representation |
---|---|
bin | 1111100101010… |
… | …1000011000000 |
3 | 11112222122011010 |
4 | 3321111003000 |
5 | 113213010224 |
6 | 10252520520 |
7 | 1422360060 |
oct | 371250300 |
9 | 145878133 |
10 | 65360064 |
11 | 33991a90 |
12 | 19a80140 |
13 | 107058c3 |
14 | 89753a0 |
15 | 5b10e29 |
hex | 3e550c0 |
65360064 has 112 divisors (see below), whose sum is σ = 215652096. Its totient is φ = 16972800.
The previous prime is 65360063. The next prime is 65360081. The reversal of 65360064 is 46006356.
It is a tau number, because it is divible by the number of its divisors (112).
It is not an unprimeable number, because it can be changed into a prime (65360063) 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 15 ways as a sum of consecutive naturals, for example, 12574 + ... + 16994.
Almost surely, 265360064 is an apocalyptic number.
65360064 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 65360064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107826048).
65360064 is an abundant number, since it is smaller than the sum of its proper divisors (150292032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65360064 is a wasteful number, since it uses less digits than its factorization.
65360064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4454 (or 4444 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 30.
The square root of 65360064 is about 8084.5571307277. The cubic root of 65360064 is about 402.8136289920.
The spelling of 65360064 in words is "sixty-five million, three hundred sixty thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •