Base | Representation |
---|---|
bin | 10011110010111010000001… |
… | …000101100111110001111001 |
3 | 102102020222001102122100120222 |
4 | 103302322001011213301321 |
5 | 42402402220110340231 |
6 | 505055201431225425 |
7 | 24223650345611465 |
oct | 2362720105476171 |
9 | 372228042570528 |
10 | 87061152824441 |
11 | 258164780a9614 |
12 | 992104bb18275 |
13 | 3976aa6a02563 |
14 | 176dad480d4a5 |
15 | a0e9d8ba827b |
hex | 4f2e81167c79 |
87061152824441 has 4 divisors (see below), whose sum is σ = 87213624195984. Its totient is φ = 86908681452900.
The previous prime is 87061152824357. The next prime is 87061152824479. The reversal of 87061152824441 is 14442825116078.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 87061152824441 - 214 = 87061152808057 is a prime.
It is a super-2 number, since 2×870611528244412 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (87061152824341) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 76235684915 + ... + 76235686056.
It is an arithmetic number, because the mean of its divisors is an integer number (21803406048996).
Almost surely, 287061152824441 is an apocalyptic number.
It is an amenable number.
87061152824441 is a deficient number, since it is larger than the sum of its proper divisors (152471371543).
87061152824441 is a wasteful number, since it uses less digits than its factorization.
87061152824441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 152471371542.
The product of its (nonzero) digits is 3440640, while the sum is 53.
The spelling of 87061152824441 in words is "eighty-seven trillion, sixty-one billion, one hundred fifty-two million, eight hundred twenty-four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •