Base | Representation |
---|---|
bin | 1010100111111… |
… | …01101110011100 |
3 | 20012200202011120 |
4 | 11103331232130 |
5 | 140303312034 |
6 | 12502050540 |
7 | 2131335015 |
oct | 523755634 |
9 | 205622146 |
10 | 89119644 |
11 | 4633a9a9 |
12 | 25a19a50 |
13 | 15604323 |
14 | bb9c00c |
15 | 7c55c49 |
hex | 54fdb9c |
89119644 has 48 divisors (see below), whose sum is σ = 221050368. Its totient is φ = 27848448.
The previous prime is 89119621. The next prime is 89119649. The reversal of 89119644 is 44691198.
It is a junction number, because it is equal to n+sod(n) for n = 89119596 and 89119605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (89119649) 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 15 ways as a sum of consecutive naturals, for example, 61917 + ... + 63339.
It is an arithmetic number, because the mean of its divisors is an integer number (4605216).
Almost surely, 289119644 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 89119644, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (110525184).
89119644 is an abundant number, since it is smaller than the sum of its proper divisors (131930724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
89119644 is a wasteful number, since it uses less digits than its factorization.
89119644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1754 (or 1752 counting only the distinct ones).
The product of its digits is 62208, while the sum is 42.
The square root of 89119644 is about 9440.3201216908. The cubic root of 89119644 is about 446.6744873758.
The spelling of 89119644 in words is "eighty-nine million, one hundred nineteen thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •