Base | Representation |
---|---|
bin | 101000010010100000… |
… | …0100111111011110001 |
3 | 22021022202010221010010 |
4 | 1100211000213323301 |
5 | 2404143142011411 |
6 | 103425153325133 |
7 | 6152024062605 |
oct | 1204500477361 |
9 | 267282127103 |
10 | 86520266481 |
11 | 33769486870 |
12 | 149275667a9 |
13 | 820ac3046c |
14 | 428aad7505 |
15 | 23b5b247a6 |
hex | 1425027ef1 |
86520266481 has 16 divisors (see below), whose sum is σ = 125868441600. Its totient is φ = 52427866320.
The previous prime is 86520266473. The next prime is 86520266489. The reversal of 86520266481 is 18466202568.
It is an interprime number because it is at equal distance from previous prime (86520266473) and next prime (86520266489).
It is not a de Polignac number, because 86520266481 - 23 = 86520266473 is a prime.
It is a super-2 number, since 2×865202664812 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 86520266481.
It is not an unprimeable number, because it can be changed into a prime (86520266489) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10681 + ... + 416118.
It is an arithmetic number, because the mean of its divisors is an integer number (7866777600).
Almost surely, 286520266481 is an apocalyptic number.
It is an amenable number.
86520266481 is a deficient number, since it is larger than the sum of its proper divisors (39348175119).
86520266481 is a wasteful number, since it uses less digits than its factorization.
86520266481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432956.
The product of its (nonzero) digits is 1105920, while the sum is 48.
The spelling of 86520266481 in words is "eighty-six billion, five hundred twenty million, two hundred sixty-six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •