Base | Representation |
---|---|
bin | 1111100001001… |
… | …0111110000001 |
3 | 11112110212212212 |
4 | 3320102332001 |
5 | 113130330114 |
6 | 10243031505 |
7 | 1420152020 |
oct | 370227601 |
9 | 145425785 |
10 | 65089409 |
11 | 33817700 |
12 | 1996b595 |
13 | 1063c658 |
14 | 89048b7 |
15 | 5aaab3e |
hex | 3e12f81 |
65089409 has 12 divisors (see below), whose sum is σ = 81766272. Its totient is φ = 50718360.
The previous prime is 65089403. The next prime is 65089411. The reversal of 65089409 is 90498056.
65089409 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 65089409 - 212 = 65085313 is a prime.
It is a super-3 number, since 3×650894093 (a number of 24 digits) contains 333 as substring.
It is a hoax number, since the sum of its digits (41) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (65089403) 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 11 ways as a sum of consecutive naturals, for example, 37577 + ... + 39270.
It is an arithmetic number, because the mean of its divisors is an integer number (6813856).
Almost surely, 265089409 is an apocalyptic number.
It is an amenable number.
65089409 is a deficient number, since it is larger than the sum of its proper divisors (16676863).
65089409 is a wasteful number, since it uses less digits than its factorization.
65089409 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76876 (or 76865 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 41.
The square root of 65089409 is about 8067.8007536131. The cubic root of 65089409 is about 402.2568447649.
The spelling of 65089409 in words is "sixty-five million, eighty-nine thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •