Base | Representation |
---|---|
bin | 10011100100100010101111… |
… | …001100100011010000001001 |
3 | 102021202121020220100101021001 |
4 | 103210202233030203100021 |
5 | 42240214210440233021 |
6 | 503021515511015001 |
7 | 24062435016404305 |
oct | 2344425714432011 |
9 | 367677226311231 |
10 | 86074083914761 |
11 | 254758a5472228 |
12 | 97a189866a461 |
13 | 390499c75c267 |
14 | 1738017914d05 |
15 | 9e3eb77d1091 |
hex | 4e48af323409 |
86074083914761 has 8 divisors (see below), whose sum is σ = 86195467720160. Its totient is φ = 85952730603168.
The previous prime is 86074083914729. The next prime is 86074083914783. The reversal of 86074083914761 is 16741938047068.
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 86074083914761 - 25 = 86074083914729 is a prime.
It is a super-2 number, since 2×860740839147612 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 86074083914693 and 86074083914702.
It is not an unprimeable number, because it can be changed into a prime (86074083917761) 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, 1971171 + ... + 13267768.
It is an arithmetic number, because the mean of its divisors is an integer number (10774433465020).
Almost surely, 286074083914761 is an apocalyptic number.
It is an amenable number.
86074083914761 is a deficient number, since it is larger than the sum of its proper divisors (121383805399).
86074083914761 is a wasteful number, since it uses less digits than its factorization.
86074083914761 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15246903.
The product of its (nonzero) digits is 48771072, while the sum is 64.
The spelling of 86074083914761 in words is "eighty-six trillion, seventy-four billion, eighty-three million, nine hundred fourteen thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •