Base | Representation |
---|---|
bin | 11101110111001001010… |
… | …100110101001110101001 |
3 | 21021011202210001200202212 |
4 | 131313021110311032221 |
5 | 232110123213102023 |
6 | 4210413341334505 |
7 | 301154245252034 |
oct | 35671124651651 |
9 | 7234683050685 |
10 | 2052077081513 |
11 | 721310018a28 |
12 | 291858567435 |
13 | 11b6827292c4 |
14 | 7146cdc201b |
15 | 385a4dade78 |
hex | 1ddc95353a9 |
2052077081513 has 2 divisors, whose sum is σ = 2052077081514. Its totient is φ = 2052077081512.
The previous prime is 2052077081477. The next prime is 2052077081519. The reversal of 2052077081513 is 3151807702502.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1976701026304 + 75376055209 = 1405952^2 + 274547^2 .
It is a cyclic number.
It is not a de Polignac number, because 2052077081513 - 222 = 2052072887209 is a prime.
It is a super-5 number, since 5×20520770815135 (a number of 63 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (2052077081519) 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, 1026038540756 + 1026038540757.
It is an arithmetic number, because the mean of its divisors is an integer number (1026038540757).
Almost surely, 22052077081513 is an apocalyptic number.
It is an amenable number.
2052077081513 is a deficient number, since it is larger than the sum of its proper divisors (1).
2052077081513 is an equidigital number, since it uses as much as digits as its factorization.
2052077081513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 117600, while the sum is 41.
The spelling of 2052077081513 in words is "two trillion, fifty-two billion, seventy-seven million, eighty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •