Base | Representation |
---|---|
bin | 10011101011011110010110… |
… | …011100011001111100101111 |
3 | 102100110010201212221010221111 |
4 | 103223132112130121330233 |
5 | 42321020214430313130 |
6 | 504024413124212451 |
7 | 24142026562410451 |
oct | 2353362634317457 |
9 | 370403655833844 |
10 | 86550410010415 |
11 | 256399060a4a1a |
12 | 985a07123a127 |
13 | 393a8900175c0 |
14 | 17530c29462d1 |
15 | a01594d8902a |
hex | 4eb796719f2f |
86550410010415 has 8 divisors (see below), whose sum is σ = 111849760628928. Its totient is φ = 63914148930720.
The previous prime is 86550410010413. The next prime is 86550410010437. The reversal of 86550410010415 is 51401001405568.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 86550410010415 - 21 = 86550410010413 is a prime.
It is a super-3 number, since 3×865504100104153 (a number of 43 digits) contains 333 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 (86550410010413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 665772384631 + ... + 665772384760.
It is an arithmetic number, because the mean of its divisors is an integer number (13981220078616).
Almost surely, 286550410010415 is an apocalyptic number.
86550410010415 is a deficient number, since it is larger than the sum of its proper divisors (25299350618513).
86550410010415 is a wasteful number, since it uses less digits than its factorization.
86550410010415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1331544769409.
The product of its (nonzero) digits is 96000, while the sum is 40.
The spelling of 86550410010415 in words is "eighty-six trillion, five hundred fifty billion, four hundred ten million, ten thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •