Base | Representation |
---|---|
bin | 111011110111010… |
… | …0010110111101101 |
3 | 12011222201000212202 |
4 | 1313232202313231 |
5 | 13103211041112 |
6 | 531153111245 |
7 | 100530404345 |
oct | 16756426755 |
9 | 5158630782 |
10 | 2008690157 |
11 | 940942711 |
12 | 480858525 |
13 | 2601ca976 |
14 | 150abbd25 |
15 | bb52c6c2 |
hex | 77ba2ded |
2008690157 has 2 divisors, whose sum is σ = 2008690158. Its totient is φ = 2008690156.
The previous prime is 2008690111. The next prime is 2008690171. The reversal of 2008690157 is 7510968002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1540876516 + 467813641 = 39254^2 + 21629^2 .
It is a cyclic number.
It is not a de Polignac number, because 2008690157 - 26 = 2008690093 is a prime.
It is a super-2 number, since 2×20086901572 = 8069672293657369298, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2008690157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2008690757) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1004345078 + 1004345079.
It is an arithmetic number, because the mean of its divisors is an integer number (1004345079).
Almost surely, 22008690157 is an apocalyptic number.
It is an amenable number.
2008690157 is a deficient number, since it is larger than the sum of its proper divisors (1).
2008690157 is an equidigital number, since it uses as much as digits as its factorization.
2008690157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30240, while the sum is 38.
The square root of 2008690157 is about 44818.4131468306. The cubic root of 2008690157 is about 1261.7432318849.
The spelling of 2008690157 in words is "two billion, eight million, six hundred ninety thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •