Base | Representation |
---|---|
bin | 10011101011011000100110… |
… | …110010000011110010101101 |
3 | 102100102112211000010001110202 |
4 | 103223120212302003302231 |
5 | 42320420101331440331 |
6 | 504021513055243245 |
7 | 24141420662401556 |
oct | 2353304662036255 |
9 | 370375730101422 |
10 | 86544241671341 |
11 | 25637230246533 |
12 | 9858a2b519525 |
13 | 393a1190cb51c |
14 | 1752a9963732d |
15 | a0133359cecb |
hex | 4eb626c83cad |
86544241671341 has 4 divisors (see below), whose sum is σ = 91635079416732. Its totient is φ = 81453403925952.
The previous prime is 86544241671317. The next prime is 86544241671347. The reversal of 86544241671341 is 14317614244568.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 27023726449225 + 59520515222116 = 5198435^2 + 7714954^2 .
It is a cyclic number.
It is not a de Polignac number, because 86544241671341 - 210 = 86544241670317 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (86544241671347) 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, 2545418872670 + ... + 2545418872703.
It is an arithmetic number, because the mean of its divisors is an integer number (22908769854183).
Almost surely, 286544241671341 is an apocalyptic number.
It is an amenable number.
86544241671341 is a deficient number, since it is larger than the sum of its proper divisors (5090837745391).
86544241671341 is a wasteful number, since it uses less digits than its factorization.
86544241671341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5090837745390.
The product of its digits is 15482880, while the sum is 56.
The spelling of 86544241671341 in words is "eighty-six trillion, five hundred forty-four billion, two hundred forty-one million, six hundred seventy-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •