Base | Representation |
---|---|
bin | 10011101011111000011110… |
… | …111111110000100001010101 |
3 | 102100112211011111020002111021 |
4 | 103223320132333300201111 |
5 | 42322000202010024221 |
6 | 504045333404041141 |
7 | 24144042134140315 |
oct | 2353703677604125 |
9 | 370484144202437 |
10 | 86578470783061 |
11 | 2564a7a572a814 |
12 | 98635a28331b1 |
13 | 39404126c2b9a |
14 | 17545c55d5445 |
15 | a02188607041 |
hex | 4ebe1eff0855 |
86578470783061 has 8 divisors (see below), whose sum is σ = 91674268207704. Its totient is φ = 81483000714240.
The previous prime is 86578470783031. The next prime is 86578470783109. The reversal of 86578470783061 is 16038707487568.
It can be written as a sum of positive squares in 4 ways, for example, as 22102870474161 + 64475600308900 = 4701369^2 + 8029670^2 .
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 86578470783061 - 229 = 86577933912149 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (86578470783031) 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, 81294330 + ... + 82352443.
It is an arithmetic number, because the mean of its divisors is an integer number (11459283525963).
Almost surely, 286578470783061 is an apocalyptic number.
It is an amenable number.
86578470783061 is a deficient number, since it is larger than the sum of its proper divisors (5095797424643).
86578470783061 is a wasteful number, since it uses less digits than its factorization.
86578470783061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163677911.
The product of its (nonzero) digits is 379330560, while the sum is 70.
The spelling of 86578470783061 in words is "eighty-six trillion, five hundred seventy-eight billion, four hundred seventy million, seven hundred eighty-three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •