Base | Representation |
---|---|
bin | 100111110000100… |
… | …010000110011001 |
3 | 1201111010211122022 |
4 | 213300202012121 |
5 | 2331230042014 |
6 | 150104504225 |
7 | 22346460365 |
oct | 4760420631 |
9 | 1644124568 |
10 | 667034009 |
11 | 312583584 |
12 | 16747b075 |
13 | a82693a5 |
14 | 648362a5 |
15 | 3d85ea8e |
hex | 27c22199 |
667034009 has 2 divisors, whose sum is σ = 667034010. Its totient is φ = 667034008.
The previous prime is 667033993. The next prime is 667034023. The reversal of 667034009 is 900430766.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 415018384 + 252015625 = 20372^2 + 15875^2 .
It is a cyclic number.
It is not a de Polignac number, because 667034009 - 24 = 667033993 is a prime.
It is a super-2 number, since 2×6670340092 = 889868738325224162, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 667034009.
It is not a weakly prime, because it can be changed into another prime (667034029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 333517004 + 333517005.
It is an arithmetic number, because the mean of its divisors is an integer number (333517005).
Almost surely, 2667034009 is an apocalyptic number.
It is an amenable number.
667034009 is a deficient number, since it is larger than the sum of its proper divisors (1).
667034009 is an equidigital number, since it uses as much as digits as its factorization.
667034009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 35.
The square root of 667034009 is about 25827.0015487667. The cubic root of 667034009 is about 873.7408868181.
The spelling of 667034009 in words is "six hundred sixty-seven million, thirty-four thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •