Base | Representation |
---|---|
bin | 11000001100101001100011… |
… | …10110001011101111001101 |
3 | 20222101221101001100212122112 |
4 | 30012110301312023233031 |
5 | 23433303002121230311 |
6 | 305100514220153405 |
7 | 14131244540153012 |
oct | 1406246166135715 |
9 | 228357331325575 |
10 | 53211186117581 |
11 | 15a55812394738 |
12 | 5b74826698865 |
13 | 238ca40c02c1b |
14 | d1d61409d709 |
15 | 6242298cd28b |
hex | 306531d8bbcd |
53211186117581 has 2 divisors, whose sum is σ = 53211186117582. Its totient is φ = 53211186117580.
The previous prime is 53211186117527. The next prime is 53211186117601. The reversal of 53211186117581 is 18571168111235.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 32991181002025 + 20220005115556 = 5743795^2 + 4496666^2 .
It is a cyclic number.
It is not a de Polignac number, because 53211186117581 - 218 = 53211185855437 is a prime.
It is a super-2 number, since 2×532111861175812 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53211186117511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26605593058790 + 26605593058791.
It is an arithmetic number, because the mean of its divisors is an integer number (26605593058791).
Almost surely, 253211186117581 is an apocalyptic number.
It is an amenable number.
53211186117581 is a deficient number, since it is larger than the sum of its proper divisors (1).
53211186117581 is an equidigital number, since it uses as much as digits as its factorization.
53211186117581 is an evil number, because the sum of its binary digits is even.
The product of its digits is 403200, while the sum is 50.
The spelling of 53211186117581 in words is "fifty-three trillion, two hundred eleven billion, one hundred eighty-six million, one hundred seventeen thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •