Base | Representation |
---|---|
bin | 101000000011110000… |
… | …0101010111110010101 |
3 | 22020001020212121210101 |
4 | 1100013200222332111 |
5 | 2402134442213221 |
6 | 103304113454101 |
7 | 6133534263526 |
oct | 1200740527625 |
9 | 266036777711 |
10 | 86025351061 |
11 | 33535082561 |
12 | 14809871331 |
13 | 815c5387c0 |
14 | 42410a684d |
15 | 2387462d91 |
hex | 140782af95 |
86025351061 has 8 divisors (see below), whose sum is σ = 92792359520. Its totient is φ = 79279724592.
The previous prime is 86025351059. The next prime is 86025351101. The reversal of 86025351061 is 16015352068.
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 86025351061 - 21 = 86025351059 is a prime.
It is a super-2 number, since 2×860253510612 (a number of 23 digits) contains 22 as substring.
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 86025351061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (86025351011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5337135 + ... + 5353228.
It is an arithmetic number, because the mean of its divisors is an integer number (11599044940).
Almost surely, 286025351061 is an apocalyptic number.
It is an amenable number.
86025351061 is a deficient number, since it is larger than the sum of its proper divisors (6767008459).
86025351061 is a wasteful number, since it uses less digits than its factorization.
86025351061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10690995.
The product of its (nonzero) digits is 43200, while the sum is 37.
The spelling of 86025351061 in words is "eighty-six billion, twenty-five million, three hundred fifty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •