Base | Representation |
---|---|
bin | 1010010101001… |
… | …11000010000101 |
3 | 20001002011022121 |
4 | 11022213002011 |
5 | 134141324042 |
6 | 12333325541 |
7 | 2101442425 |
oct | 512470205 |
9 | 201064277 |
10 | 86667397 |
11 | 44a15553 |
12 | 250368b1 |
13 | 14c560ab |
14 | b720485 |
15 | 791e367 |
hex | 52a7085 |
86667397 has 4 divisors (see below), whose sum is σ = 88088236. Its totient is φ = 85246560.
The previous prime is 86667391. The next prime is 86667409. The reversal of 86667397 is 79376668.
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 45077796 + 41589601 = 6714^2 + 6449^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-86667397 is a prime.
It is a super-2 number, since 2×866673972 = 15022475405511218, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (86667391) 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 3 ways as a sum of consecutive naturals, for example, 710328 + ... + 710449.
It is an arithmetic number, because the mean of its divisors is an integer number (22022059).
Almost surely, 286667397 is an apocalyptic number.
It is an amenable number.
86667397 is a deficient number, since it is larger than the sum of its proper divisors (1420839).
86667397 is a wasteful number, since it uses less digits than its factorization.
86667397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1420838.
The product of its digits is 2286144, while the sum is 52.
The square root of 86667397 is about 9309.5325876222. The cubic root of 86667397 is about 442.5393744954.
The spelling of 86667397 in words is "eighty-six million, six hundred sixty-seven thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •