Base | Representation |
---|---|
bin | 1111010101001… |
… | …1110010000001 |
3 | 11111000002200000 |
4 | 3311103302001 |
5 | 112430300210 |
6 | 10214150213 |
7 | 1410410640 |
oct | 365236201 |
9 | 144002600 |
10 | 64306305 |
11 | 33332308 |
12 | 19652369 |
13 | 1042708b |
14 | 877d357 |
15 | 59a3ac0 |
hex | 3d53c81 |
64306305 has 48 divisors (see below), whose sum is σ = 132123264. Its totient is φ = 29393280.
The previous prime is 64306301. The next prime is 64306313. The reversal of 64306305 is 50360346.
64306305 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 64306305 - 22 = 64306301 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a zygodrome in base 3.
It is not an unprimeable number, because it can be changed into a prime (64306301) 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 47 ways as a sum of consecutive naturals, for example, 4725 + ... + 12285.
It is an arithmetic number, because the mean of its divisors is an integer number (2752568).
Almost surely, 264306305 is an apocalyptic number.
It is an amenable number.
64306305 is an abundant number, since it is smaller than the sum of its proper divisors (67816959).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64306305 is an equidigital number, since it uses as much as digits as its factorization.
64306305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7588 (or 7576 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
The square root of 64306305 is about 8019.1212112051. The cubic root of 64306305 is about 400.6371200729.
The spelling of 64306305 in words is "sixty-four million, three hundred six thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •