Base | Representation |
---|---|
bin | 101000011000111001… |
… | …1100111110110010000 |
3 | 22021212201010121002101 |
4 | 1100301303213312100 |
5 | 2410113122241224 |
6 | 103502343130144 |
7 | 6160242004342 |
oct | 1206163476620 |
9 | 267781117071 |
10 | 86734962064 |
11 | 33869696833 |
12 | 14987443954 |
13 | 824356167a |
14 | 42ab423292 |
15 | 23c98d3044 |
hex | 1431ce7d90 |
86734962064 has 135 divisors (see below), whose sum is σ = 184082372643. Its totient is φ = 39581875200.
The previous prime is 86734962037. The next prime is 86734962071. The reversal of 86734962064 is 46026943768.
The square root of 86734962064 is 294508.
It is a perfect power (a square), and thus also a powerful number.
86734962064 is nontrivially palindromic in base 11.
It can be written as a sum of positive squares in 4 ways, for example, as 8003091600 + 78731870464 = 89460^2 + 280592^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 86734961996 and 86734962014.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 1221619149 + ... + 1221619219.
Almost surely, 286734962064 is an apocalyptic number.
86734962064 is the 294508-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 86734962064
86734962064 is an abundant number, since it is smaller than the sum of its proper divisors (97347410579).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
86734962064 is an equidigital number, since it uses as much as digits as its factorization.
86734962064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 306 (or 151 counting only the distinct ones).
The product of its (nonzero) digits is 10450944, while the sum is 55.
The spelling of 86734962064 in words is "eighty-six billion, seven hundred thirty-four million, nine hundred sixty-two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •