Base | Representation |
---|---|
bin | 100111110010111… |
… | …101101000000001 |
3 | 1201112100012111002 |
4 | 213302331220001 |
5 | 2331410433131 |
6 | 150130301345 |
7 | 22355052542 |
oct | 4762755001 |
9 | 1645305432 |
10 | 667671041 |
11 | 312979154 |
12 | 167727855 |
13 | a843032b |
14 | 649604c9 |
15 | 3d9386cb |
hex | 27cbda01 |
667671041 has 2 divisors, whose sum is σ = 667671042. Its totient is φ = 667671040.
The previous prime is 667670987. The next prime is 667671083. The reversal of 667671041 is 140176766.
667671041 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., 520752400 + 146918641 = 22820^2 + 12121^2 .
It is a cyclic number.
It is not a de Polignac number, because 667671041 - 218 = 667408897 is a prime.
It is a Chen prime.
It is equal to p34663934 and since 667671041 and 34663934 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 667670986 and 667671004.
It is not a weakly prime, because it can be changed into another prime (667671541) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 333835520 + 333835521.
It is an arithmetic number, because the mean of its divisors is an integer number (333835521).
Almost surely, 2667671041 is an apocalyptic number.
It is an amenable number.
667671041 is a deficient number, since it is larger than the sum of its proper divisors (1).
667671041 is an equidigital number, since it uses as much as digits as its factorization.
667671041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42336, while the sum is 38.
The square root of 667671041 is about 25839.3312800467. The cubic root of 667671041 is about 874.0189455090.
The spelling of 667671041 in words is "six hundred sixty-seven million, six hundred seventy-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •