Base | Representation |
---|---|
bin | 111011110110001… |
… | …0101100001001101 |
3 | 12011221121121200012 |
4 | 1313230111201031 |
5 | 13103034024211 |
6 | 531132443005 |
7 | 100522443356 |
oct | 16754254115 |
9 | 5157547605 |
10 | 2008111181 |
11 | 94058771a |
12 | 480619465 |
13 | 26005728b |
14 | 1509aad2d |
15 | bb465d8b |
hex | 77b1584d |
2008111181 has 2 divisors, whose sum is σ = 2008111182. Its totient is φ = 2008111180.
The previous prime is 2008111141. The next prime is 2008111207. The reversal of 2008111181 is 1811118002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1329769156 + 678342025 = 36466^2 + 26045^2 .
It is a cyclic number.
It is not a de Polignac number, because 2008111181 - 218 = 2007849037 is a prime.
It is a super-2 number, since 2×20081111812 = 8065021030514429522, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2008111141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1004055590 + 1004055591.
It is an arithmetic number, because the mean of its divisors is an integer number (1004055591).
Almost surely, 22008111181 is an apocalyptic number.
It is an amenable number.
2008111181 is a deficient number, since it is larger than the sum of its proper divisors (1).
2008111181 is an equidigital number, since it uses as much as digits as its factorization.
2008111181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 23.
The square root of 2008111181 is about 44811.9535503642. The cubic root of 2008111181 is about 1261.6219937993.
Adding to 2008111181 its reverse (1811118002), we get a palindrome (3819229183).
The spelling of 2008111181 in words is "two billion, eight million, one hundred eleven thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •