Base | Representation |
---|---|
bin | 1010110010111… |
… | …10001010000000 |
3 | 20022102002100121 |
4 | 11121132022000 |
5 | 141141010300 |
6 | 12553030024 |
7 | 2146526440 |
oct | 531361200 |
9 | 208362317 |
10 | 90563200 |
11 | 47136522 |
12 | 263b5314 |
13 | 159bb3c0 |
14 | c056120 |
15 | 7e3d81a |
hex | 565e280 |
90563200 has 192 divisors, whose sum is σ = 276232320. Its totient is φ = 28569600.
The previous prime is 90563197. The next prime is 90563227. The reversal of 90563200 is 236509.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 291045 + ... + 291355.
It is an arithmetic number, because the mean of its divisors is an integer number (1438710).
Almost surely, 290563200 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 90563200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (138116160).
90563200 is an abundant number, since it is smaller than the sum of its proper divisors (185669120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
90563200 is a wasteful number, since it uses less digits than its factorization.
90563200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 355 (or 338 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 25.
The square root of 90563200 is about 9516.4699337517. The cubic root of 90563200 is about 449.0733193428.
Adding to 90563200 its reverse (236509), we get a palindrome (90799709).
The spelling of 90563200 in words is "ninety million, five hundred sixty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •