Base | Representation |
---|---|
bin | 110100110010001101… |
… | …111001001010011101 |
3 | 12102021220220212020111 |
4 | 310302031321022131 |
5 | 1412033312441121 |
6 | 42012002250021 |
7 | 4044340132321 |
oct | 646215711235 |
9 | 172256825214 |
10 | 56677077661 |
11 | 22044807356 |
12 | ab99056911 |
13 | 54631b0559 |
14 | 2a5942b981 |
15 | 171ab732e1 |
hex | d3237929d |
56677077661 has 2 divisors, whose sum is σ = 56677077662. Its totient is φ = 56677077660.
The previous prime is 56677077649. The next prime is 56677077671. The reversal of 56677077661 is 16677077665.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 33749364100 + 22927713561 = 183710^2 + 151419^2 .
It is a cyclic number.
It is not a de Polignac number, because 56677077661 - 217 = 56676946589 is a prime.
It is a super-2 number, since 2×566770776612 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 56677077596 and 56677077605.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56677077671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28338538830 + 28338538831.
It is an arithmetic number, because the mean of its divisors is an integer number (28338538831).
Almost surely, 256677077661 is an apocalyptic number.
It is an amenable number.
56677077661 is a deficient number, since it is larger than the sum of its proper divisors (1).
56677077661 is an equidigital number, since it uses as much as digits as its factorization.
56677077661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15558480, while the sum is 58.
The spelling of 56677077661 in words is "fifty-six billion, six hundred seventy-seven million, seventy-seven thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •