Base | Representation |
---|---|
bin | 111011111011111… |
… | …0100111000010001 |
3 | 12012011021122102002 |
4 | 1313313310320101 |
5 | 13104321420332 |
6 | 531321203345 |
7 | 100560156665 |
oct | 16767647021 |
9 | 5164248362 |
10 | 2011123217 |
11 | 942254704 |
12 | 481630555 |
13 | 26087024c |
14 | 1511528a5 |
15 | bb85d562 |
hex | 77df4e11 |
2011123217 has 2 divisors, whose sum is σ = 2011123218. Its totient is φ = 2011123216.
The previous prime is 2011123189. The next prime is 2011123237. The reversal of 2011123217 is 7123211102.
It is an a-pointer prime, because the next prime (2011123237) can be obtained adding 2011123217 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1989070801 + 22052416 = 44599^2 + 4696^2 .
It is a cyclic number.
It is not a de Polignac number, because 2011123217 - 28 = 2011122961 is a prime.
It is not a weakly prime, because it can be changed into another prime (2011123237) 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, 1005561608 + 1005561609.
It is an arithmetic number, because the mean of its divisors is an integer number (1005561609).
Almost surely, 22011123217 is an apocalyptic number.
It is an amenable number.
2011123217 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011123217 is an equidigital number, since it uses as much as digits as its factorization.
2011123217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 20.
The square root of 2011123217 is about 44845.5484635878. The cubic root of 2011123217 is about 1262.2524622943.
Adding to 2011123217 its reverse (7123211102), we get a palindrome (9134334319).
The spelling of 2011123217 in words is "two billion, eleven million, one hundred twenty-three thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •