Base | Representation |
---|---|
bin | 11101010001000100111… |
… | …101100010010011100001 |
3 | 21010021021002202222100222 |
4 | 131101010331202103201 |
5 | 230422420112122023 |
6 | 4135533331452425 |
7 | 265206311120051 |
oct | 35210475422341 |
9 | 7107232688328 |
10 | 2011201676513 |
11 | 705a44a07187 |
12 | 28594b457115 |
13 | 11786a1b2123 |
14 | 6d4b245b561 |
15 | 374b1607cc8 |
hex | 1d444f624e1 |
2011201676513 has 2 divisors, whose sum is σ = 2011201676514. Its totient is φ = 2011201676512.
The previous prime is 2011201676483. The next prime is 2011201676537. The reversal of 2011201676513 is 3156761021102.
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., 1095262716304 + 915938960209 = 1046548^2 + 957047^2 .
It is a cyclic number.
It is not a de Polignac number, because 2011201676513 - 220 = 2011200627937 is a prime.
It is not a weakly prime, because it can be changed into another prime (2011201673513) 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, 1005600838256 + 1005600838257.
It is an arithmetic number, because the mean of its divisors is an integer number (1005600838257).
Almost surely, 22011201676513 is an apocalyptic number.
It is an amenable number.
2011201676513 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011201676513 is an equidigital number, since it uses as much as digits as its factorization.
2011201676513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 35.
Adding to 2011201676513 its reverse (3156761021102), we get a palindrome (5167962697615).
The spelling of 2011201676513 in words is "two trillion, eleven billion, two hundred one million, six hundred seventy-six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •