Base | Representation |
---|---|
bin | 100111111110100… |
… | …010101011100100 |
3 | 1201202001102012221 |
4 | 213332202223210 |
5 | 2333200101104 |
6 | 150315322124 |
7 | 22422624154 |
oct | 4776425344 |
9 | 1652042187 |
10 | 670706404 |
11 | 314661715 |
12 | 168750344 |
13 | a8c53ac4 |
14 | 65110764 |
15 | 3dd37c54 |
hex | 27fa2ae4 |
670706404 has 27 divisors (see below), whose sum is σ = 1229170243. Its totient is φ = 320202872.
The previous prime is 670706401. The next prime is 670706411. The reversal of 670706404 is 404607076.
The square root of 670706404 is 25898.
It is a perfect power (a square), and thus also a powerful number.
It is a super-2 number, since 2×6707064042 = 899694160733222432, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 670706404.
It is not an unprimeable number, because it can be changed into a prime (670706401) 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 8 ways as a sum of consecutive naturals, for example, 1191027 + ... + 1191589.
Almost surely, 2670706404 is an apocalyptic number.
670706404 is the 25898-th square number.
It is an amenable number.
670706404 is a deficient number, since it is larger than the sum of its proper divisors (558463839).
670706404 is an equidigital number, since it uses as much as digits as its factorization.
670706404 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1176 (or 588 counting only the distinct ones).
The product of its (nonzero) digits is 28224, while the sum is 34.
The cubic root of 670706404 is about 875.3414304007.
Multiplying 670706404 by its product of nonzero digits (28224), we get a square (18930017546496 = 43508642).
The spelling of 670706404 in words is "six hundred seventy million, seven hundred six thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •