Base | Representation |
---|---|
bin | 101000001001011010… |
… | …0010101000001000000 |
3 | 22020112110211111110001 |
4 | 1100102310111001000 |
5 | 2403032023202001 |
6 | 103335011445344 |
7 | 6141326601514 |
oct | 1202264250100 |
9 | 266473744401 |
10 | 86215053376 |
11 | 33622171731 |
12 | 148612b6854 |
13 | 818c9288aa |
14 | 425c368144 |
15 | 2398e36001 |
hex | 1412d15040 |
86215053376 has 105 divisors (see below), whose sum is σ = 183218129499. Its totient is φ = 40252326912.
The previous prime is 86215053247. The next prime is 86215053377. The reversal of 86215053376 is 67335051268.
The square root of 86215053376 is 293624.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 2 ways, for example, as 26757107776 + 59457945600 = 163576^2 + 243840^2 .
It is not an unprimeable number, because it can be changed into a prime (86215053377) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 678858625 + ... + 678858751.
Almost surely, 286215053376 is an apocalyptic number.
86215053376 is the 293624-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 86215053376
86215053376 is an abundant number, since it is smaller than the sum of its proper divisors (97003076123).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
86215053376 is an frugal number, since it uses more digits than its factorization.
86215053376 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334 (or 146 counting only the distinct ones).
The product of its (nonzero) digits is 907200, while the sum is 46.
The spelling of 86215053376 in words is "eighty-six billion, two hundred fifteen million, fifty-three thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •