Base | Representation |
---|---|
bin | 111011111101111… |
… | …0011100000100101 |
3 | 12012020020122002101 |
4 | 1313323303200211 |
5 | 13110103304211 |
6 | 531355412101 |
7 | 100602062464 |
oct | 16773634045 |
9 | 5166218071 |
10 | 2012166181 |
11 | 9428a7263 |
12 | 481a54031 |
13 | 260b46b9c |
14 | 1513449db |
15 | bb9b75c1 |
hex | 77ef3825 |
2012166181 has 2 divisors, whose sum is σ = 2012166182. Its totient is φ = 2012166180.
The previous prime is 2012166173. The next prime is 2012166229. The reversal of 2012166181 is 1816612102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1826280225 + 185885956 = 42735^2 + 13634^2 .
It is a cyclic number.
It is not a de Polignac number, because 2012166181 - 23 = 2012166173 is a prime.
It is a super-2 number, since 2×20121661812 = 8097625479920249522, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2012166281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1006083090 + 1006083091.
It is an arithmetic number, because the mean of its divisors is an integer number (1006083091).
Almost surely, 22012166181 is an apocalyptic number.
It is an amenable number.
2012166181 is a deficient number, since it is larger than the sum of its proper divisors (1).
2012166181 is an equidigital number, since it uses as much as digits as its factorization.
2012166181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 28.
The square root of 2012166181 is about 44857.1753569036. The cubic root of 2012166181 is about 1262.4706250199.
Adding to 2012166181 its reverse (1816612102), we get a palindrome (3828778283).
The spelling of 2012166181 in words is "two billion, twelve million, one hundred sixty-six thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •