Base | Representation |
---|---|
bin | 101000000101101… |
… | …001101111001101 |
3 | 1201212120010000202 |
4 | 220011221233031 |
5 | 2334134222232 |
6 | 150423303245 |
7 | 22444516256 |
oct | 5005515715 |
9 | 1655503022 |
10 | 672570317 |
11 | 315715041 |
12 | 1692aab25 |
13 | a9457303 |
14 | 65477b2d |
15 | 3e0a5162 |
hex | 28169bcd |
672570317 has 2 divisors, whose sum is σ = 672570318. Its totient is φ = 672570316.
The previous prime is 672570293. The next prime is 672570319. The reversal of 672570317 is 713075276.
672570317 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., 596287561 + 76282756 = 24419^2 + 8734^2 .
It is a cyclic number.
It is not a de Polignac number, because 672570317 - 26 = 672570253 is a prime.
Together with 672570319, it forms a pair of twin primes.
It is a Chen prime.
It is equal to p34904747 and since 672570317 and 34904747 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (672570319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 336285158 + 336285159.
It is an arithmetic number, because the mean of its divisors is an integer number (336285159).
Almost surely, 2672570317 is an apocalyptic number.
It is an amenable number.
672570317 is a deficient number, since it is larger than the sum of its proper divisors (1).
672570317 is an equidigital number, since it uses as much as digits as its factorization.
672570317 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 61740, while the sum is 38.
The square root of 672570317 is about 25933.9606886414. The cubic root of 672570317 is about 876.1515470211.
The spelling of 672570317 in words is "six hundred seventy-two million, five hundred seventy thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •