Base | Representation |
---|---|
bin | 100111101000111… |
… | …110001101100101 |
3 | 1201100102010211202 |
4 | 213220332031211 |
5 | 2330223131010 |
6 | 145554212245 |
7 | 22323564062 |
oct | 4750761545 |
9 | 1640363752 |
10 | 665052005 |
11 | 31144a462 |
12 | 166884085 |
13 | a7a241c7 |
14 | 6447bc69 |
15 | 3d5bc6a5 |
hex | 27a3e365 |
665052005 has 4 divisors (see below), whose sum is σ = 798062412. Its totient is φ = 532041600.
The previous prime is 665052001. The next prime is 665052029. The reversal of 665052005 is 500250566.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 500250566 = 2 ⋅250125283.
It can be written as a sum of positive squares in 2 ways, for example, as 443607844 + 221444161 = 21062^2 + 14881^2 .
It is not a de Polignac number, because 665052005 - 22 = 665052001 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (665052001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66505196 + ... + 66505205.
It is an arithmetic number, because the mean of its divisors is an integer number (199515603).
Almost surely, 2665052005 is an apocalyptic number.
It is an amenable number.
665052005 is a deficient number, since it is larger than the sum of its proper divisors (133010407).
665052005 is a wasteful number, since it uses less digits than its factorization.
665052005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133010406.
The product of its (nonzero) digits is 9000, while the sum is 29.
The square root of 665052005 is about 25788.6022304428. The cubic root of 665052005 is about 872.8746261394.
The spelling of 665052005 in words is "six hundred sixty-five million, fifty-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •