Base | Representation |
---|---|
bin | 1010011100100… |
… | …00001000010001 |
3 | 20002212200000020 |
4 | 11032100020101 |
5 | 134412402121 |
6 | 12410014053 |
7 | 2112530124 |
oct | 516201021 |
9 | 202780006 |
10 | 87622161 |
11 | 45507910 |
12 | 25417329 |
13 | 151cb843 |
14 | b8cc3bb |
15 | 7a5c1c6 |
hex | 5390211 |
87622161 has 8 divisors (see below), whose sum is σ = 127450464. Its totient is φ = 53104320.
The previous prime is 87622153. The next prime is 87622163. The reversal of 87622161 is 16122678.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 87622161 - 23 = 87622153 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 2655217 = 87622161 / (8 + 7 + 6 + 2 + 2 + 1 + 6 + 1).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (87622163) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1327576 + ... + 1327641.
It is an arithmetic number, because the mean of its divisors is an integer number (15931308).
Almost surely, 287622161 is an apocalyptic number.
It is an amenable number.
87622161 is a deficient number, since it is larger than the sum of its proper divisors (39828303).
87622161 is a wasteful number, since it uses less digits than its factorization.
87622161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2655231.
The product of its digits is 8064, while the sum is 33.
The square root of 87622161 is about 9360.6709695406. The cubic root of 87622161 is about 444.1585090654.
The spelling of 87622161 in words is "eighty-seven million, six hundred twenty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •