Base | Representation |
---|---|
bin | 100111111110111… |
… | …000000100111111 |
3 | 1201202012212102222 |
4 | 213332320010333 |
5 | 2333210402142 |
6 | 150321235555 |
7 | 22423440530 |
oct | 4776700477 |
9 | 1652185388 |
10 | 670794047 |
11 | 314711550 |
12 | 168792bbb |
13 | a8c84971 |
14 | 65134687 |
15 | 3dd53bd2 |
hex | 27fb813f |
670794047 has 16 divisors (see below), whose sum is σ = 837964032. Its totient is φ = 521665920.
The previous prime is 670794029. The next prime is 670794067. The reversal of 670794047 is 740497076.
It is a cyclic number.
It is not a de Polignac number, because 670794047 - 28 = 670793791 is a prime.
It is a Smith number, since the sum of its digits (44) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 670793989 and 670794007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (670794067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31943 + ... + 48599.
It is an arithmetic number, because the mean of its divisors is an integer number (52372752).
Almost surely, 2670794047 is an apocalyptic number.
670794047 is a deficient number, since it is larger than the sum of its proper divisors (167169985).
670794047 is a wasteful number, since it uses less digits than its factorization.
670794047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17198.
The product of its (nonzero) digits is 296352, while the sum is 44.
The square root of 670794047 is about 25899.6920251960. The cubic root of 670794047 is about 875.3795564755.
The spelling of 670794047 in words is "six hundred seventy million, seven hundred ninety-four thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •