Base | Representation |
---|---|
bin | 1010010011111… |
… | …00010111111101 |
3 | 20000202021122012 |
4 | 11021330113331 |
5 | 134120231134 |
6 | 12325501005 |
7 | 2100114134 |
oct | 511742775 |
9 | 200667565 |
10 | 86492669 |
11 | 4490624a |
12 | 24b71765 |
13 | 14bc46c3 |
14 | b6b691b |
15 | 78d76ce |
hex | 527c5fd |
86492669 has 4 divisors (see below), whose sum is σ = 87384444. Its totient is φ = 85600896.
The previous prime is 86492647. The next prime is 86492671. The reversal of 86492669 is 96629468.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 61622500 + 24870169 = 7850^2 + 4987^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-86492669 is a prime.
It is a super-2 number, since 2×864926692 = 14961963581487122, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (86492639) 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 3 ways as a sum of consecutive naturals, for example, 445742 + ... + 445935.
It is an arithmetic number, because the mean of its divisors is an integer number (21846111).
Almost surely, 286492669 is an apocalyptic number.
It is an amenable number.
86492669 is a deficient number, since it is larger than the sum of its proper divisors (891775).
86492669 is an equidigital number, since it uses as much as digits as its factorization.
86492669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 891774.
The product of its digits is 1119744, while the sum is 50.
The square root of 86492669 is about 9300.1434935166. The cubic root of 86492669 is about 442.2417768425.
The spelling of 86492669 in words is "eighty-six million, four hundred ninety-two thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •