Base | Representation |
---|---|
bin | 10011101011010110001011… |
… | …110101010010101111111011 |
3 | 102100102022002211110122011102 |
4 | 103223112023311102233323 |
5 | 42320344240331104210 |
6 | 504020403112322015 |
7 | 24141266365110326 |
oct | 2353261365225773 |
9 | 370368084418142 |
10 | 86541642050555 |
11 | 2563611688a9aa |
12 | 98584249a330b |
13 | 3939ac365c083 |
14 | 17528d02937bd |
15 | a01230244ea5 |
hex | 4eb58bd52bfb |
86541642050555 has 4 divisors (see below), whose sum is σ = 103849970460672. Its totient is φ = 69233313640440.
The previous prime is 86541642050527. The next prime is 86541642050557. The reversal of 86541642050555 is 55505024614568.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 86541642050555 - 212 = 86541642046459 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 86541642050555.
It is not an unprimeable number, because it can be changed into a prime (86541642050557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8654164205051 + ... + 8654164205060.
It is an arithmetic number, because the mean of its divisors is an integer number (25962492615168).
Almost surely, 286541642050555 is an apocalyptic number.
86541642050555 is a deficient number, since it is larger than the sum of its proper divisors (17308328410117).
86541642050555 is a wasteful number, since it uses less digits than its factorization.
86541642050555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17308328410116.
The product of its (nonzero) digits is 28800000, while the sum is 56.
The spelling of 86541642050555 in words is "eighty-six trillion, five hundred forty-one billion, six hundred forty-two million, fifty thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •