Base | Representation |
---|---|
bin | 10011100111100100100010… |
… | …001000011110010110000101 |
3 | 102022111111100211021002110011 |
4 | 103213210202020132112011 |
5 | 42302121341141444013 |
6 | 503301252040030221 |
7 | 24113452423462624 |
oct | 2347444210362605 |
9 | 368444324232404 |
10 | 86282170656133 |
11 | 25546076a66961 |
12 | 9816090462371 |
13 | 391b4b22721aa |
14 | 17441179dd6bb |
15 | 9e95e5b86c3d |
hex | 4e792221e585 |
86282170656133 has 8 divisors (see below), whose sum is σ = 86859097220160. Its totient is φ = 85705316743200.
The previous prime is 86282170656119. The next prime is 86282170656137. The reversal of 86282170656133 is 33165607128268.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 86282170656133 - 29 = 86282170655621 is a prime.
It is a super-2 number, since 2×862821706561332 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (86282170656137) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15778543 + ... + 20531116.
It is an arithmetic number, because the mean of its divisors is an integer number (10857387152520).
Almost surely, 286282170656133 is an apocalyptic number.
It is an amenable number.
86282170656133 is a deficient number, since it is larger than the sum of its proper divisors (576926564027).
86282170656133 is a wasteful number, since it uses less digits than its factorization.
86282170656133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36325547.
The product of its (nonzero) digits is 17418240, while the sum is 58.
The spelling of 86282170656133 in words is "eighty-six trillion, two hundred eighty-two billion, one hundred seventy million, six hundred fifty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •