Base | Representation |
---|---|
bin | 101000011101100111110… |
… | …1101101000101110111101 |
3 | 201200122100200020020112011 |
4 | 1100323033231220232331 |
5 | 1212103240131344221 |
6 | 15454433431211221 |
7 | 1112532016355413 |
oct | 120731755505675 |
9 | 21618320206464 |
10 | 5561172528061 |
11 | 1854530a04777 |
12 | 759961516b11 |
13 | 3145548652b7 |
14 | 15323b07b2b3 |
15 | 999d39b81e1 |
hex | 50ecfb68bbd |
5561172528061 has 2 divisors, whose sum is σ = 5561172528062. Its totient is φ = 5561172528060.
The previous prime is 5561172528019. The next prime is 5561172528083. The reversal of 5561172528061 is 1608252711655.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5518975562500 + 42196965561 = 2349250^2 + 205419^2 .
It is a cyclic number.
It is not a de Polignac number, because 5561172528061 - 225 = 5561138973629 is a prime.
It is a super-3 number, since 3×55611725280613 (a number of 39 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5561172527996 and 5561172528014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5561172528011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2780586264030 + 2780586264031.
It is an arithmetic number, because the mean of its divisors is an integer number (2780586264031).
Almost surely, 25561172528061 is an apocalyptic number.
It is an amenable number.
5561172528061 is a deficient number, since it is larger than the sum of its proper divisors (1).
5561172528061 is an equidigital number, since it uses as much as digits as its factorization.
5561172528061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1008000, while the sum is 49.
The spelling of 5561172528061 in words is "five trillion, five hundred sixty-one billion, one hundred seventy-two million, five hundred twenty-eight thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •