Base | Representation |
---|---|
bin | 1111100000000… |
… | …0100101001101 |
3 | 11112100001120101 |
4 | 3320000211031 |
5 | 113120422333 |
6 | 10241251101 |
7 | 1416416314 |
oct | 370004515 |
9 | 145301511 |
10 | 65014093 |
11 | 33776061 |
12 | 19933a91 |
13 | 106142a1 |
14 | 88c527b |
15 | 5a9367d |
hex | 3e0094d |
65014093 has 4 divisors (see below), whose sum is σ = 66240828. Its totient is φ = 63787360.
The previous prime is 65014091. The next prime is 65014097. The reversal of 65014093 is 39041056.
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 20097289 + 44916804 = 4483^2 + 6702^2 .
It is a cyclic number.
It is not a de Polignac number, because 65014093 - 21 = 65014091 is a prime.
It is a super-4 number, since 4×650140934 (a number of 32 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (65014091) 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, 613288 + ... + 613393.
It is an arithmetic number, because the mean of its divisors is an integer number (16560207).
Almost surely, 265014093 is an apocalyptic number.
It is an amenable number.
65014093 is a deficient number, since it is larger than the sum of its proper divisors (1226735).
65014093 is a wasteful number, since it uses less digits than its factorization.
65014093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1226734.
The product of its (nonzero) digits is 3240, while the sum is 28.
The square root of 65014093 is about 8063.1317116862. The cubic root of 65014093 is about 402.1016322658.
The spelling of 65014093 in words is "sixty-five million, fourteen thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •