Base | Representation |
---|---|
bin | 100111111011110… |
… | …111100100001001 |
3 | 1201200201210210000 |
4 | 213323313210021 |
5 | 2333010134023 |
6 | 150252313213 |
7 | 22413644562 |
oct | 4773674411 |
9 | 1650653700 |
10 | 670005513 |
11 | 314223071 |
12 | 168472809 |
13 | a8a69a88 |
14 | 64dab169 |
15 | 3dc4a243 |
hex | 27ef7909 |
670005513 has 20 divisors (see below), whose sum is σ = 1059749460. Its totient is φ = 420394752.
The previous prime is 670005499. The next prime is 670005527. The reversal of 670005513 is 315500076.
It is an interprime number because it is at equal distance from previous prime (670005499) and next prime (670005527).
It can be written as a sum of positive squares in 2 ways, for example, as 563255289 + 106750224 = 23733^2 + 10332^2 .
It is not a de Polignac number, because 670005513 - 214 = 669989129 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (670015513) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 241908 + ... + 244661.
It is an arithmetic number, because the mean of its divisors is an integer number (52987473).
Almost surely, 2670005513 is an apocalyptic number.
It is an amenable number.
670005513 is a deficient number, since it is larger than the sum of its proper divisors (389743947).
670005513 is a wasteful number, since it uses less digits than its factorization.
670005513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 486598 (or 486589 counting only the distinct ones).
The product of its (nonzero) digits is 3150, while the sum is 27.
The square root of 670005513 is about 25884.4647037562. The cubic root of 670005513 is about 875.0364123078.
Adding to 670005513 its reverse (315500076), we get a palindrome (985505589).
The spelling of 670005513 in words is "six hundred seventy million, five thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •