Base | Representation |
---|---|
bin | 101000001100100100… |
… | …0100000001110101001 |
3 | 22020210212012102102002 |
4 | 1100121020200032221 |
5 | 2403241134133411 |
6 | 103353314420345 |
7 | 6144054304004 |
oct | 1203110401651 |
9 | 266725172362 |
10 | 86321005481 |
11 | 33676a59057 |
12 | 148908916b5 |
13 | 81a8874649 |
14 | 426c46853b |
15 | 23a33b433b |
hex | 14192203a9 |
86321005481 has 8 divisors (see below), whose sum is σ = 87217681320. Its totient is φ = 85424467968.
The previous prime is 86321005387. The next prime is 86321005489. The reversal of 86321005481 is 18450012368.
It can be written as a sum of positive squares in 4 ways, for example, as 8393491456 + 77927514025 = 91616^2 + 279155^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-86321005481 is a prime.
It is a super-2 number, since 2×863210054812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (86321005489) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1636325 + ... + 1688253.
It is an arithmetic number, because the mean of its divisors is an integer number (10902210165).
Almost surely, 286321005481 is an apocalyptic number.
It is an amenable number.
86321005481 is a deficient number, since it is larger than the sum of its proper divisors (896675839).
86321005481 is a wasteful number, since it uses less digits than its factorization.
86321005481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69163.
The product of its (nonzero) digits is 46080, while the sum is 38.
The spelling of 86321005481 in words is "eighty-six billion, three hundred twenty-one million, five thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •