Base | Representation |
---|---|
bin | 1010100111100… |
… | …01111001100000 |
3 | 20012121021201100 |
4 | 11103301321200 |
5 | 140300234300 |
6 | 12501034400 |
7 | 2131043541 |
oct | 523617140 |
9 | 205537640 |
10 | 89071200 |
11 | 46307569 |
12 | 259b5a00 |
13 | 155b826a |
14 | bb884c8 |
15 | 7c46700 |
hex | 54f1e60 |
89071200 has 216 divisors, whose sum is σ = 319901400. Its totient is φ = 23316480.
The previous prime is 89071127. The next prime is 89071219. The reversal of 89071200 is 217098.
It is a congruent number.
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 35 ways as a sum of consecutive naturals, for example, 640731 + ... + 640869.
It is an arithmetic number, because the mean of its divisors is an integer number (1481025).
Almost surely, 289071200 is an apocalyptic number.
89071200 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 89071200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159950700).
89071200 is an abundant number, since it is smaller than the sum of its proper divisors (230830200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
89071200 is a wasteful number, since it uses less digits than its factorization.
89071200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254 (or 238 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
The square root of 89071200 is about 9437.7539700927. The cubic root of 89071200 is about 446.5935376925.
Adding to 89071200 its reverse (217098), we get a palindrome (89288298).
The spelling of 89071200 in words is "eighty-nine million, seventy-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •