Base | Representation |
---|---|
bin | 1010101010110… |
… | …11000100110000 |
3 | 20020102011122220 |
4 | 11111123010300 |
5 | 140403031000 |
6 | 12514201040 |
7 | 2134516530 |
oct | 525330460 |
9 | 206364586 |
10 | 89502000 |
11 | 465811a5 |
12 | 25b83180 |
13 | 15709383 |
14 | bc5b4c0 |
15 | 7cce1a0 |
hex | 555b130 |
89502000 has 160 divisors (see below), whose sum is σ = 329931264. Its totient is φ = 20448000.
The previous prime is 89501999. The next prime is 89502019. The reversal of 89502000 is 20598.
It is a hoax number, since the sum of its digits (24) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 40935 + ... + 43065.
Almost surely, 289502000 is an apocalyptic number.
89502000 is a gapful number since it is divisible by the number (80) 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 89502000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (164965632).
89502000 is an abundant number, since it is smaller than the sum of its proper divisors (240429264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
89502000 is a wasteful number, since it uses less digits than its factorization.
89502000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2164 (or 2148 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 24.
The square root of 89502000 is about 9460.5496669063. The cubic root of 89502000 is about 447.3123751801.
Adding to 89502000 its reverse (20598), we get a palindrome (89522598).
The spelling of 89502000 in words is "eighty-nine million, five hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •