Base | Representation |
---|---|
bin | 101000010111111111… |
… | …1100101011001101101 |
3 | 22021210120220011110000 |
4 | 1100233333211121231 |
5 | 2410032330341331 |
6 | 103455335134513 |
7 | 6156422313123 |
oct | 1205777453155 |
9 | 267716804400 |
10 | 86704543341 |
11 | 338534aa799 |
12 | 14979214439 |
13 | 823a170c20 |
14 | 42a7385913 |
15 | 23c6dc50e6 |
hex | 142ffe566d |
86704543341 has 20 divisors (see below), whose sum is σ = 139484803612. Its totient is φ = 53356641408.
The previous prime is 86704543339. The next prime is 86704543351. The reversal of 86704543341 is 14334540768.
86704543341 is a `hidden beast` number, since 8 + 6 + 70 + 4 + 543 + 34 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 12093620841 + 74610922500 = 109971^2 + 273150^2 .
It is not a de Polignac number, because 86704543341 - 21 = 86704543339 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 (86704543351) 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 in 19 ways as a sum of consecutive naturals, for example, 41169196 + ... + 41171301.
Almost surely, 286704543341 is an apocalyptic number.
86704543341 is a gapful number since it is divisible by the number (81) formed by its first and last digit.
It is an amenable number.
86704543341 is a deficient number, since it is larger than the sum of its proper divisors (52780260271).
86704543341 is a wasteful number, since it uses less digits than its factorization.
86704543341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82340522 (or 82340513 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 45.
The spelling of 86704543341 in words is "eighty-six billion, seven hundred four million, five hundred forty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •