Base | Representation |
---|---|
bin | 1001100000110110… |
… | …0101000100101101 |
3 | 20120222020020002222 |
4 | 2120031211010231 |
5 | 20212221242212 |
6 | 1101222325125 |
7 | 120166030316 |
oct | 23015450455 |
9 | 6528206088 |
10 | 2553696557 |
11 | 10a054a025 |
12 | 5b32897a5 |
13 | 3190b0269 |
14 | 1a322b60d |
15 | ee2d5c72 |
hex | 9836512d |
2553696557 has 2 divisors, whose sum is σ = 2553696558. Its totient is φ = 2553696556.
The previous prime is 2553696527. The next prime is 2553696559. The reversal of 2553696557 is 7556963552.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2450349001 + 103347556 = 49501^2 + 10166^2 .
It is a cyclic number.
It is not a de Polignac number, because 2553696557 - 26 = 2553696493 is a prime.
It is a super-2 number, since 2×25536965572 = 13042732210467308498, which contains 22 as substring.
Together with 2553696559, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 2553696499 and 2553696508.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2553696559) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1276848278 + 1276848279.
It is an arithmetic number, because the mean of its divisors is an integer number (1276848279).
Almost surely, 22553696557 is an apocalyptic number.
It is an amenable number.
2553696557 is a deficient number, since it is larger than the sum of its proper divisors (1).
2553696557 is an equidigital number, since it uses as much as digits as its factorization.
2553696557 is an evil number, because the sum of its binary digits is even.
The product of its digits is 8505000, while the sum is 53.
The square root of 2553696557 is about 50534.1128051141. The cubic root of 2553696557 is about 1366.8570495500.
The spelling of 2553696557 in words is "two billion, five hundred fifty-three million, six hundred ninety-six thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •