Base | Representation |
---|---|
bin | 11101110111101011010… |
… | …111011001001000000101 |
3 | 21021020020120200102010022 |
4 | 131313223113121020011 |
5 | 232112310413200211 |
6 | 4210550142104525 |
7 | 301204351430636 |
oct | 35675327311005 |
9 | 7236216612108 |
10 | 2052648178181 |
11 | 721583425347 |
12 | 29199787b145 |
13 | 11b743b45123 |
14 | 714c4ba388d |
15 | 385da0bcbdb |
hex | 1ddeb5d9205 |
2052648178181 has 2 divisors, whose sum is σ = 2052648178182. Its totient is φ = 2052648178180.
The previous prime is 2052648178121. The next prime is 2052648178199. The reversal of 2052648178181 is 1818718462502.
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., 1113753069025 + 938895109156 = 1055345^2 + 968966^2 .
It is a cyclic number.
It is not a de Polignac number, because 2052648178181 - 26 = 2052648178117 is a prime.
It is a super-2 number, since 2×20526481781812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2052648178121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1026324089090 + 1026324089091.
It is an arithmetic number, because the mean of its divisors is an integer number (1026324089091).
Almost surely, 22052648178181 is an apocalyptic number.
It is an amenable number.
2052648178181 is a deficient number, since it is larger than the sum of its proper divisors (1).
2052648178181 is an equidigital number, since it uses as much as digits as its factorization.
2052648178181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1720320, while the sum is 53.
The spelling of 2052648178181 in words is "two trillion, fifty-two billion, six hundred forty-eight million, one hundred seventy-eight thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •