Base | Representation |
---|---|
bin | 1010101100101… |
… | …10100001100000 |
3 | 20020212112200120 |
4 | 11112112201200 |
5 | 140433324004 |
6 | 12523320240 |
7 | 2136552462 |
oct | 526264140 |
9 | 206775616 |
10 | 89745504 |
11 | 46728142 |
12 | 26080080 |
13 | 15793164 |
14 | bcc2132 |
15 | 7d2b3d9 |
hex | 5596860 |
89745504 has 48 divisors (see below), whose sum is σ = 237695472. Its totient is φ = 29646848.
The previous prime is 89745503. The next prime is 89745521. The reversal of 89745504 is 40554798.
It is a tau number, because it is divible by the number of its divisors (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (89745503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6712 + ... + 14984.
It is an arithmetic number, because the mean of its divisors is an integer number (4951989).
Almost surely, 289745504 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 89745504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (118847736).
89745504 is an abundant number, since it is smaller than the sum of its proper divisors (147949968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
89745504 is a wasteful number, since it uses less digits than its factorization.
89745504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8399 (or 8391 counting only the distinct ones).
The product of its (nonzero) digits is 201600, while the sum is 42.
The square root of 89745504 is about 9473.4103679720. The cubic root of 89745504 is about 447.7176686246.
The spelling of 89745504 in words is "eighty-nine million, seven hundred forty-five thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •