Base | Representation |
---|---|
bin | 110101011010010… |
… | …111110011011000 |
3 | 2022110011212220120 |
4 | 311122113303120 |
5 | 3313400340223 |
6 | 224530353240 |
7 | 31130526012 |
oct | 6532276330 |
9 | 2273155816 |
10 | 896105688 |
11 | 41a912515 |
12 | 21012b820 |
13 | 113861c6a |
14 | 870251b2 |
15 | 53a0cbe3 |
hex | 35697cd8 |
896105688 has 32 divisors (see below), whose sum is σ = 2278238400. Its totient is φ = 293638688.
The previous prime is 896105687. The next prime is 896105689. The reversal of 896105688 is 886501698.
It is an interprime number because it is at equal distance from previous prime (896105687) and next prime (896105689).
It is a self number, because there is not a number n which added to its sum of digits gives 896105688.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (896105687) 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 7 ways as a sum of consecutive naturals, for example, 315006 + ... + 317837.
It is an arithmetic number, because the mean of its divisors is an integer number (71194950).
Almost surely, 2896105688 is an apocalyptic number.
It is an amenable number.
896105688 is an abundant number, since it is smaller than the sum of its proper divisors (1382132712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
896105688 is a wasteful number, since it uses less digits than its factorization.
896105688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 632911 (or 632907 counting only the distinct ones).
The product of its (nonzero) digits is 829440, while the sum is 51.
The square root of 896105688 is about 29935.0244362686. The cubic root of 896105688 is about 964.0948094054.
The spelling of 896105688 in words is "eight hundred ninety-six million, one hundred five thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •