Base | Representation |
---|---|
bin | 101001010101110001100… |
… | …0011110001001001000101 |
3 | 202010011121100122111102101 |
4 | 1102223203003301021011 |
5 | 1221042214040243221 |
6 | 20030055053312101 |
7 | 1124331133454152 |
oct | 122534303611105 |
9 | 22104540574371 |
10 | 5681756181061 |
11 | 18a068a271a44 |
12 | 7791b4795631 |
13 | 322a3094376c |
14 | 158dd9b13229 |
15 | 9cbded0cd91 |
hex | 52ae30f1245 |
5681756181061 has 2 divisors, whose sum is σ = 5681756181062. Its totient is φ = 5681756181060.
The previous prime is 5681756180917. The next prime is 5681756181067. The reversal of 5681756181061 is 1601816571865.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3075568912900 + 2606187268161 = 1753730^2 + 1614369^2 .
It is a cyclic number.
It is not a de Polignac number, because 5681756181061 - 211 = 5681756179013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5681756180993 and 5681756181011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5681756181067) 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, 2840878090530 + 2840878090531.
It is an arithmetic number, because the mean of its divisors is an integer number (2840878090531).
Almost surely, 25681756181061 is an apocalyptic number.
It is an amenable number.
5681756181061 is a deficient number, since it is larger than the sum of its proper divisors (1).
5681756181061 is an equidigital number, since it uses as much as digits as its factorization.
5681756181061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2419200, while the sum is 55.
The spelling of 5681756181061 in words is "five trillion, six hundred eighty-one billion, seven hundred fifty-six million, one hundred eighty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •