Base | Representation |
---|---|
bin | 1010101001110… |
… | …01100110110000 |
3 | 20020011012121120 |
4 | 11110321212300 |
5 | 140334134122 |
6 | 12511222240 |
7 | 2133406050 |
oct | 524714660 |
9 | 206135546 |
10 | 89364912 |
11 | 464981aa |
12 | 25b17980 |
13 | 1568bb60 |
14 | bc23560 |
15 | 7ca375c |
hex | 55399b0 |
89364912 has 160 divisors (see below), whose sum is σ = 291648000. Its totient is φ = 22947840.
The previous prime is 89364893. The next prime is 89364941. The reversal of 89364912 is 21946398.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
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 in 31 ways as a sum of consecutive naturals, for example, 178839 + ... + 179337.
It is an arithmetic number, because the mean of its divisors is an integer number (1822800).
Almost surely, 289364912 is an apocalyptic number.
89364912 is a gapful number since it is divisible by the number (82) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 89364912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (145824000).
89364912 is an abundant number, since it is smaller than the sum of its proper divisors (202283088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
89364912 is a wasteful number, since it uses less digits than its factorization.
89364912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 571 (or 565 counting only the distinct ones).
The product of its digits is 93312, while the sum is 42.
The square root of 89364912 is about 9453.3016454570. The cubic root of 89364912 is about 447.0838793789.
The spelling of 89364912 in words is "eighty-nine million, three hundred sixty-four thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •