Base | Representation |
---|---|
bin | 111011111100001… |
… | …0011011101110001 |
3 | 12012011112000021002 |
4 | 1313320103131301 |
5 | 13104334422442 |
6 | 531324011345 |
7 | 100561221146 |
oct | 16770233561 |
9 | 5164460232 |
10 | 2011248497 |
11 | 94232a845 |
12 | 481690b55 |
13 | 2608b528b |
14 | 1511863cd |
15 | bb885732 |
hex | 77e13771 |
2011248497 has 2 divisors, whose sum is σ = 2011248498. Its totient is φ = 2011248496.
The previous prime is 2011248457. The next prime is 2011248517. The reversal of 2011248497 is 7948421102.
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., 1857265216 + 153983281 = 43096^2 + 12409^2 .
It is a cyclic number.
It is not a de Polignac number, because 2011248497 - 212 = 2011244401 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2011248497.
It is not a weakly prime, because it can be changed into another prime (2011248457) 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, 1005624248 + 1005624249.
It is an arithmetic number, because the mean of its divisors is an integer number (1005624249).
Almost surely, 22011248497 is an apocalyptic number.
It is an amenable number.
2011248497 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011248497 is an equidigital number, since it uses as much as digits as its factorization.
2011248497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32256, while the sum is 38.
The square root of 2011248497 is about 44846.9452359913. The cubic root of 2011248497 is about 1262.2786718114.
Adding to 2011248497 its reverse (7948421102), we get a palindrome (9959669599).
The spelling of 2011248497 in words is "two billion, eleven million, two hundred forty-eight thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •