Base | Representation |
---|---|
bin | 1111100100011… |
… | …1101000001001 |
3 | 11112212211202022 |
4 | 3321013220021 |
5 | 113204230342 |
6 | 10251414225 |
7 | 1422040604 |
oct | 371075011 |
9 | 145784668 |
10 | 65305097 |
11 | 33954760 |
12 | 19a54375 |
13 | 106b6890 |
14 | 895d33b |
15 | 5aee9d2 |
hex | 3e47a09 |
65305097 has 8 divisors (see below), whose sum is σ = 76722240. Its totient is φ = 54801360.
The previous prime is 65305091. The next prime is 65305103. The reversal of 65305097 is 79050356.
65305097 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (65305091) and next prime (65305103).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-65305097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (65305091) 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 7 ways as a sum of consecutive naturals, for example, 228197 + ... + 228482.
It is an arithmetic number, because the mean of its divisors is an integer number (9590280).
Almost surely, 265305097 is an apocalyptic number.
It is an amenable number.
65305097 is a deficient number, since it is larger than the sum of its proper divisors (11417143).
65305097 is a wasteful number, since it uses less digits than its factorization.
65305097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 456703.
The product of its (nonzero) digits is 28350, while the sum is 35.
The square root of 65305097 is about 8081.1569097500. The cubic root of 65305097 is about 402.7006769068.
The spelling of 65305097 in words is "sixty-five million, three hundred five thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •