Base | Representation |
---|---|
bin | 11000111010000110111… |
… | …01010110000110001001 |
3 | 10000211001021121201010002 |
4 | 30131003131112012021 |
5 | 103010220021224212 |
6 | 1453055112332345 |
7 | 115555162110455 |
oct | 14350335260611 |
9 | 3024037551102 |
10 | 855830258057 |
11 | 2aaa56961a35 |
12 | 119a479a40b5 |
13 | 62920893428 |
14 | 2d5cb11b665 |
15 | 173de940ac2 |
hex | c743756189 |
855830258057 has 2 divisors, whose sum is σ = 855830258058. Its totient is φ = 855830258056.
The previous prime is 855830258039. The next prime is 855830258077. The reversal of 855830258057 is 750852038558.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 576416526841 + 279413731216 = 759221^2 + 528596^2 .
It is a cyclic number.
It is not a de Polignac number, because 855830258057 - 230 = 854756516233 is a prime.
It is a super-2 number, since 2×8558302580572 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 855830257993 and 855830258011.
It is not a weakly prime, because it can be changed into another prime (855830258077) 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, 427915129028 + 427915129029.
It is an arithmetic number, because the mean of its divisors is an integer number (427915129029).
Almost surely, 2855830258057 is an apocalyptic number.
It is an amenable number.
855830258057 is a deficient number, since it is larger than the sum of its proper divisors (1).
855830258057 is an equidigital number, since it uses as much as digits as its factorization.
855830258057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13440000, while the sum is 56.
The spelling of 855830258057 in words is "eight hundred fifty-five billion, eight hundred thirty million, two hundred fifty-eight thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •