Base | Representation |
---|---|
bin | 10011110010111010000001… |
… | …000101100011110001111001 |
3 | 102102020222001102121112010011 |
4 | 103302322001011203301321 |
5 | 42402402220104324212 |
6 | 505055201431021521 |
7 | 24223650345512641 |
oct | 2362720105436171 |
9 | 372228042545104 |
10 | 87061152808057 |
11 | 2581647809827a |
12 | 992104bb0a8a1 |
13 | 3976aa69c7c6c |
14 | 176dad4807521 |
15 | a0e9d8ba34a7 |
hex | 4f2e81163c79 |
87061152808057 has 2 divisors, whose sum is σ = 87061152808058. Its totient is φ = 87061152808056.
The previous prime is 87061152807989. The next prime is 87061152808087. The reversal of 87061152808057 is 75080825116078.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61766851737721 + 25294301070336 = 7859189^2 + 5029344^2 .
It is a cyclic number.
It is not a de Polignac number, because 87061152808057 - 223 = 87061144419449 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 87061152807992 and 87061152808010.
It is not a weakly prime, because it can be changed into another prime (87061152808087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 43530576404028 + 43530576404029.
It is an arithmetic number, because the mean of its divisors is an integer number (43530576404029).
Almost surely, 287061152808057 is an apocalyptic number.
It is an amenable number.
87061152808057 is a deficient number, since it is larger than the sum of its proper divisors (1).
87061152808057 is an equidigital number, since it uses as much as digits as its factorization.
87061152808057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7526400, while the sum is 58.
The spelling of 87061152808057 in words is "eighty-seven trillion, sixty-one billion, one hundred fifty-two million, eight hundred eight thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •