Base | Representation |
---|---|
bin | 10011101011000000100001… |
… | …111000110101000010101000 |
3 | 102100100002002100011200121110 |
4 | 103223000201320311002220 |
5 | 42320004130234143242 |
6 | 504001555523110320 |
7 | 24136514231631321 |
oct | 2353004170650250 |
9 | 370302070150543 |
10 | 86518389756072 |
11 | 2562727453a9aa |
12 | 9853a158123a0 |
13 | 3937859236041 |
14 | 175172608d448 |
15 | a0081dbeb39c |
hex | 4eb021e350a8 |
86518389756072 has 16 divisors (see below), whose sum is σ = 216295974390240. Its totient is φ = 28839463252016.
The previous prime is 86518389756059. The next prime is 86518389756079. The reversal of 86518389756072 is 27065798381568.
It is a junction number, because it is equal to n+sod(n) for n = 86518389755985 and 86518389756003.
It is not an unprimeable number, because it can be changed into a prime (86518389756079) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1802466453228 + ... + 1802466453275.
It is an arithmetic number, because the mean of its divisors is an integer number (13518498399390).
Almost surely, 286518389756072 is an apocalyptic number.
It is an amenable number.
86518389756072 is an abundant number, since it is smaller than the sum of its proper divisors (129777584634168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
86518389756072 is a wasteful number, since it uses less digits than its factorization.
86518389756072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3604932906512 (or 3604932906508 counting only the distinct ones).
The product of its (nonzero) digits is 1219276800, while the sum is 75.
The spelling of 86518389756072 in words is "eighty-six trillion, five hundred eighteen billion, three hundred eighty-nine million, seven hundred fifty-six thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •