Base | Representation |
---|---|
bin | 1010101110010… |
… | …00010110100000 |
3 | 20021020220122200 |
4 | 11113020112200 |
5 | 141011341400 |
6 | 12531533200 |
7 | 2141362506 |
oct | 527102640 |
9 | 207226580 |
10 | 89949600 |
11 | 46857514 |
12 | 2615a200 |
13 | 15835020 |
14 | bd36676 |
15 | 7d6bb00 |
hex | 55c85a0 |
89949600 has 324 divisors, whose sum is σ = 352957878. Its totient is φ = 21427200.
The previous prime is 89949599. The next prime is 89949641. The reversal of 89949600 is 694998.
It can be written as a sum of positive squares in 3 ways, for example, as 49956624 + 39992976 = 7068^2 + 6324^2 .
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
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 53 ways as a sum of consecutive naturals, for example, 2901585 + ... + 2901615.
Almost surely, 289949600 is an apocalyptic number.
89949600 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 89949600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (176478939).
89949600 is an abundant number, since it is smaller than the sum of its proper divisors (263008278).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
89949600 is a wasteful number, since it uses less digits than its factorization.
89949600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101 (or 54 counting only the distinct ones).
The product of its (nonzero) digits is 139968, while the sum is 45.
The square root of 89949600 is about 9484.1762952826. The cubic root of 89949600 is about 448.0568061470.
The spelling of 89949600 in words is "eighty-nine million, nine hundred forty-nine thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •