Base | Representation |
---|---|
bin | 101000000011101100… |
… | …0010011001100000010 |
3 | 22020001002202010101200 |
4 | 1100013120103030002 |
5 | 2402133412001412 |
6 | 103303554442030 |
7 | 6133506523404 |
oct | 1200730231402 |
9 | 266032663350 |
10 | 86023156482 |
11 | 3353391375a |
12 | 14808b93316 |
13 | 815bc4a933 |
14 | 4240a94b74 |
15 | 238717c9dc |
hex | 1407613302 |
86023156482 has 24 divisors (see below), whose sum is σ = 186414584304. Its totient is φ = 28669604184.
The previous prime is 86023156477. The next prime is 86023156487. The reversal of 86023156482 is 28465132068.
86023156482 is a `hidden beast` number, since 8 + 6 + 0 + 2 + 3 + 1 + 564 + 82 = 666.
It is an interprime number because it is at equal distance from previous prime (86023156477) and next prime (86023156487).
It is a super-2 number, since 2×860231564822 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (86023156487) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 286648 + ... + 504195.
It is an arithmetic number, because the mean of its divisors is an integer number (7767274346).
Almost surely, 286023156482 is an apocalyptic number.
86023156482 is an abundant number, since it is smaller than the sum of its proper divisors (100391427822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
86023156482 is a wasteful number, since it uses less digits than its factorization.
86023156482 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 796894 (or 796891 counting only the distinct ones).
The product of its (nonzero) digits is 552960, while the sum is 45.
The spelling of 86023156482 in words is "eighty-six billion, twenty-three million, one hundred fifty-six thousand, four hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •