Base | Representation |
---|---|
bin | 101000000011001100… |
… | …0011101111110010001 |
3 | 22012222221020222222102 |
4 | 1100012120131332101 |
5 | 2402120121022231 |
6 | 103302200050145 |
7 | 6133214352131 |
oct | 1200630357621 |
9 | 265887228872 |
10 | 86006423441 |
11 | 335254249a4 |
12 | 14803463955 |
13 | 815863c523 |
14 | 423c77aac1 |
15 | 2385974acb |
hex | 140661df91 |
86006423441 has 8 divisors (see below), whose sum is σ = 88291467264. Its totient is φ = 83740343040.
The previous prime is 86006423429. The next prime is 86006423479. The reversal of 86006423441 is 14432460068.
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 86006423441 - 210 = 86006422417 is a prime.
It is a super-2 number, since 2×860064234412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 86006423395 and 86006423404.
It is not an unprimeable number, because it can be changed into a prime (86006423411) 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, 4731665 + ... + 4749806.
It is an arithmetic number, because the mean of its divisors is an integer number (11036433408).
Almost surely, 286006423441 is an apocalyptic number.
It is an amenable number.
86006423441 is a deficient number, since it is larger than the sum of its proper divisors (2285043823).
86006423441 is a wasteful number, since it uses less digits than its factorization.
86006423441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9481711.
The product of its (nonzero) digits is 110592, while the sum is 38.
The spelling of 86006423441 in words is "eighty-six billion, six million, four hundred twenty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •