Base | Representation |
---|---|
bin | 10011100111010111011110… |
… | …110110101111100101000111 |
3 | 102022110011012012011021010211 |
4 | 103213113132312233211013 |
5 | 42301404141200022100 |
6 | 503251013315300251 |
7 | 24112445231604064 |
oct | 2347273666574507 |
9 | 368404165137124 |
10 | 86268157032775 |
11 | 25540135703253 |
12 | 981341b2aa687 |
13 | 391a08aba3473 |
14 | 17435887bbc6b |
15 | 9e90757621ba |
hex | 4e75dedaf947 |
86268157032775 has 48 divisors (see below), whose sum is σ = 111001440738816. Its totient is φ = 66464564728320.
The previous prime is 86268157032751. The next prime is 86268157032793. The reversal of 86268157032775 is 57723075186268.
It is a de Polignac number, because none of the positive numbers 2k-86268157032775 is a prime.
It is a super-4 number, since 4×862681570327754 (a number of 57 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (67).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 86268157032775.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 70799487 + ... + 72007663.
It is an arithmetic number, because the mean of its divisors is an integer number (2312530015392).
Almost surely, 286268157032775 is an apocalyptic number.
86268157032775 is a deficient number, since it is larger than the sum of its proper divisors (24733283706041).
86268157032775 is a wasteful number, since it uses less digits than its factorization.
86268157032775 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1209208 (or 1209203 counting only the distinct ones).
The product of its (nonzero) digits is 237081600, while the sum is 67.
The spelling of 86268157032775 in words is "eighty-six trillion, two hundred sixty-eight billion, one hundred fifty-seven million, thirty-two thousand, seven hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •