Base | Representation |
---|---|
bin | 10100011101001110001 |
3 | 1021001111201 |
4 | 2203221301 |
5 | 132422241 |
6 | 22211201 |
7 | 5461201 |
oct | 2435161 |
9 | 1231451 |
10 | 670321 |
11 | 418693 |
12 | 283b01 |
13 | 1a6152 |
14 | 136401 |
15 | d3931 |
hex | a3a71 |
670321 has 2 divisors, whose sum is σ = 670322. Its totient is φ = 670320.
The previous prime is 670303. The next prime is 670333. The reversal of 670321 is 123076.
670321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 600625 + 69696 = 775^2 + 264^2 .
It is a cyclic number.
It is not a de Polignac number, because 670321 - 27 = 670193 is a prime.
It is a Chen prime.
It is an alternating number because its digits alternate between even and odd.
670321 is a lucky number.
It is equal to p54334 and since 670321 and 54334 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (674321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 335160 + 335161.
It is an arithmetic number, because the mean of its divisors is an integer number (335161).
2670321 is an apocalyptic number.
It is an amenable number.
670321 is a deficient number, since it is larger than the sum of its proper divisors (1).
670321 is an equidigital number, since it uses as much as digits as its factorization.
670321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 252, while the sum is 19.
The square root of 670321 is about 818.7313356651. The cubic root of 670321 is about 87.5173734210.
Adding to 670321 its reverse (123076), we get a palindrome (793397).
It can be divided in two parts, 6703 and 21, that added together give a square (6724 = 822).
The spelling of 670321 in words is "six hundred seventy thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •