Base | Representation |
---|---|
bin | 110101011101011… |
… | …001011001100101 |
3 | 2022111200011122221 |
4 | 311131121121211 |
5 | 3314101224121 |
6 | 224555352341 |
7 | 31140340621 |
oct | 6535313145 |
9 | 2274604587 |
10 | 896898661 |
11 | 42030426a |
12 | 2104526b1 |
13 | 113a7bb89 |
14 | 87190181 |
15 | 53b17b41 |
hex | 35759665 |
896898661 has 4 divisors (see below), whose sum is σ = 897005824. Its totient is φ = 896791500.
The previous prime is 896898637. The next prime is 896898671. The reversal of 896898661 is 166898698.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 896898661 - 217 = 896767589 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 896898661.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (896898671) 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, 39855 + ... + 58156.
It is an arithmetic number, because the mean of its divisors is an integer number (224251456).
Almost surely, 2896898661 is an apocalyptic number.
It is an amenable number.
896898661 is a deficient number, since it is larger than the sum of its proper divisors (107163).
896898661 is an equidigital number, since it uses as much as digits as its factorization.
896898661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107162.
The product of its digits is 8957952, while the sum is 61.
The square root of 896898661 is about 29948.2664105955. The cubic root of 896898661 is about 964.3791046507.
The spelling of 896898661 in words is "eight hundred ninety-six million, eight hundred ninety-eight thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •