Base | Representation |
---|---|
bin | 1111100111011… |
… | …0000000000001 |
3 | 11120020111022021 |
4 | 3321312000001 |
5 | 113231320131 |
6 | 10255441441 |
7 | 1423461433 |
oct | 371660001 |
9 | 146214267 |
10 | 65495041 |
11 | 33a74437 |
12 | 19b26281 |
13 | 10752181 |
14 | 89ac653 |
15 | 5b3ae11 |
hex | 3e76001 |
65495041 has 4 divisors (see below), whose sum is σ = 65517012. Its totient is φ = 65473072.
The previous prime is 65495039. The next prime is 65495093. The reversal of 65495041 is 14059456.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 12278016 + 53217025 = 3504^2 + 7295^2 .
It is a cyclic number.
It is not a de Polignac number, because 65495041 - 21 = 65495039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 65494988 and 65495006.
It is not an unprimeable number, because it can be changed into a prime (65495741) 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, 5650 + ... + 12763.
It is an arithmetic number, because the mean of its divisors is an integer number (16379253).
It is a Proth number, since it is equal to 7995 ⋅ 213 + 1 and 7995 < 213.
Almost surely, 265495041 is an apocalyptic number.
It is an amenable number.
65495041 is a deficient number, since it is larger than the sum of its proper divisors (21971).
65495041 is a wasteful number, since it uses less digits than its factorization.
65495041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21970.
The product of its (nonzero) digits is 21600, while the sum is 34.
The square root of 65495041 is about 8092.9006542772. The cubic root of 65495041 is about 403.0907257762.
The spelling of 65495041 in words is "sixty-five million, four hundred ninety-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •