Base | Representation |
---|---|
bin | 10011110010110001000101… |
… | …101101110001001101100001 |
3 | 102102020001022100210220111102 |
4 | 103302301011231301031201 |
5 | 42402223102044000111 |
6 | 505050534313124145 |
7 | 24223160655601004 |
oct | 2362610555611541 |
9 | 372201270726442 |
10 | 87051566781281 |
11 | 258123a90224a3 |
12 | 991b2156b9655 |
13 | 3975c09a0227b |
14 | 176d46564553b |
15 | a0e62731913b |
hex | 4f2c45b71361 |
87051566781281 has 2 divisors, whose sum is σ = 87051566781282. Its totient is φ = 87051566781280.
The previous prime is 87051566781269. The next prime is 87051566781427. The reversal of 87051566781281 is 18218766515078.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 53524455913681 + 33527110867600 = 7316041^2 + 5790260^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-87051566781281 is a prime.
It is a super-2 number, since 2×870515667812812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (87051566781211) 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, 43525783390640 + 43525783390641.
It is an arithmetic number, because the mean of its divisors is an integer number (43525783390641).
Almost surely, 287051566781281 is an apocalyptic number.
It is an amenable number.
87051566781281 is a deficient number, since it is larger than the sum of its proper divisors (1).
87051566781281 is an equidigital number, since it uses as much as digits as its factorization.
87051566781281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45158400, while the sum is 65.
The spelling of 87051566781281 in words is "eighty-seven trillion, fifty-one billion, five hundred sixty-six million, seven hundred eighty-one thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •