Base | Representation |
---|---|
bin | 100100001000001… |
… | …001101100111101 |
3 | 1120020111220202112 |
4 | 210020021230331 |
5 | 2220131213134 |
6 | 140051103405 |
7 | 21006622664 |
oct | 4410115475 |
9 | 1506456675 |
10 | 606116669 |
11 | 291156474 |
12 | 14aba1b65 |
13 | 9875aa22 |
14 | 5a6d9ddb |
15 | 3832a1ce |
hex | 24209b3d |
606116669 has 2 divisors, whose sum is σ = 606116670. Its totient is φ = 606116668.
The previous prime is 606116629. The next prime is 606116671. The reversal of 606116669 is 966611606.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 312405625 + 293711044 = 17675^2 + 17138^2 .
It is a cyclic number.
It is not a de Polignac number, because 606116669 - 216 = 606051133 is a prime.
It is a super-2 number, since 2×6061166692 = 734754832879311122, which contains 22 as substring.
Together with 606116671, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (606116629) 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, 303058334 + 303058335.
It is an arithmetic number, because the mean of its divisors is an integer number (303058335).
Almost surely, 2606116669 is an apocalyptic number.
It is an amenable number.
606116669 is a deficient number, since it is larger than the sum of its proper divisors (1).
606116669 is an equidigital number, since it uses as much as digits as its factorization.
606116669 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69984, while the sum is 41.
The square root of 606116669 is about 24619.4368132173. The cubic root of 606116669 is about 846.2890908620.
The spelling of 606116669 in words is "six hundred six million, one hundred sixteen thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •