Base | Representation |
---|---|
bin | 1010100111110… |
… | …10101000010001 |
3 | 20012200002202211 |
4 | 11103322220101 |
5 | 140302410321 |
6 | 12501512121 |
7 | 2131253026 |
oct | 523725021 |
9 | 205602684 |
10 | 89106961 |
11 | 46331419 |
12 | 25a12641 |
13 | 155cb618 |
14 | bb9754d |
15 | 7c520e1 |
hex | 54faa11 |
89106961 has 2 divisors, whose sum is σ = 89106962. Its totient is φ = 89106960.
The previous prime is 89106943. The next prime is 89107001. The reversal of 89106961 is 16960198.
It is an a-pointer prime, because the next prime (89107001) can be obtained adding 89106961 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 52128400 + 36978561 = 7220^2 + 6081^2 .
It is a cyclic number.
It is not a de Polignac number, because 89106961 - 211 = 89104913 is a prime.
It is not a weakly prime, because it can be changed into another prime (89106931) 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 as a sum of consecutive naturals, namely, 44553480 + 44553481.
It is an arithmetic number, because the mean of its divisors is an integer number (44553481).
Almost surely, 289106961 is an apocalyptic number.
It is an amenable number.
89106961 is a deficient number, since it is larger than the sum of its proper divisors (1).
89106961 is an equidigital number, since it uses as much as digits as its factorization.
89106961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 40.
The square root of 89106961 is about 9439.6483515012. The cubic root of 89106961 is about 446.6532969811.
The spelling of 89106961 in words is "eighty-nine million, one hundred six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •