Base | Representation |
---|---|
bin | 110101001011110000… |
… | …011001000010100111 |
3 | 12110101210011120212221 |
4 | 311023300121002213 |
5 | 1413423010122102 |
6 | 42122310053211 |
7 | 4061062115263 |
oct | 651360310247 |
9 | 173353146787 |
10 | 57105551527 |
11 | 22244660092 |
12 | b09864a207 |
13 | 5500bb129b |
14 | 2a9a2c50a3 |
15 | 17435ad637 |
hex | d4bc190a7 |
57105551527 has 2 divisors, whose sum is σ = 57105551528. Its totient is φ = 57105551526.
The previous prime is 57105551467. The next prime is 57105551543. The reversal of 57105551527 is 72515550175.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 57105551527 - 223 = 57097162919 is a prime.
It is a super-2 number, since 2×571055515272 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (57105551567) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28552775763 + 28552775764.
It is an arithmetic number, because the mean of its divisors is an integer number (28552775764).
Almost surely, 257105551527 is an apocalyptic number.
57105551527 is a deficient number, since it is larger than the sum of its proper divisors (1).
57105551527 is an equidigital number, since it uses as much as digits as its factorization.
57105551527 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 306250, while the sum is 43.
The spelling of 57105551527 in words is "fifty-seven billion, one hundred five million, five hundred fifty-one thousand, five hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •