Base | Representation |
---|---|
bin | 11101111111001111100… |
… | …111001000011000100001 |
3 | 21022000012202222112012011 |
4 | 131333033213020120201 |
5 | 232230430223221244 |
6 | 4214412242032521 |
7 | 301612602013501 |
oct | 35771747103041 |
9 | 7260182875164 |
10 | 2060772476449 |
11 | 724a7237a935 |
12 | 293484648741 |
13 | 11c43a0586cb |
14 | 71a55b85a01 |
15 | 3891346c434 |
hex | 1dfcf9c8621 |
2060772476449 has 2 divisors, whose sum is σ = 2060772476450. Its totient is φ = 2060772476448.
The previous prime is 2060772476267. The next prime is 2060772476461. The reversal of 2060772476449 is 9446742770602.
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., 1683942238224 + 376830238225 = 1297668^2 + 613865^2 .
It is a cyclic number.
It is not a de Polignac number, because 2060772476449 - 235 = 2026412738081 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2060772476393 and 2060772476402.
It is not a weakly prime, because it can be changed into another prime (2060772416449) 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, 1030386238224 + 1030386238225.
It is an arithmetic number, because the mean of its divisors is an integer number (1030386238225).
Almost surely, 22060772476449 is an apocalyptic number.
It is an amenable number.
2060772476449 is a deficient number, since it is larger than the sum of its proper divisors (1).
2060772476449 is an equidigital number, since it uses as much as digits as its factorization.
2060772476449 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28449792, while the sum is 58.
The spelling of 2060772476449 in words is "two trillion, sixty billion, seven hundred seventy-two million, four hundred seventy-six thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •