Base | Representation |
---|---|
bin | 1010110010011… |
… | …01110000100000 |
3 | 20022021200012220 |
4 | 11121031300200 |
5 | 141131333112 |
6 | 12551351040 |
7 | 2146126554 |
oct | 531156040 |
9 | 208250186 |
10 | 90496032 |
11 | 470a0010 |
12 | 26382480 |
13 | 15996963 |
14 | c039864 |
15 | 7e2898c |
hex | 564dc20 |
90496032 has 144 divisors (see below), whose sum is σ = 278310816. Its totient is φ = 25446400.
The previous prime is 90496027. The next prime is 90496067. The reversal of 90496032 is 23069409.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 90495984 and 90496002.
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, 1274557 + ... + 1274627.
It is an arithmetic number, because the mean of its divisors is an integer number (1932714).
Almost surely, 290496032 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 90496032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (139155408).
90496032 is an abundant number, since it is smaller than the sum of its proper divisors (187814784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
90496032 is a wasteful number, since it uses less digits than its factorization.
90496032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183 (or 104 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 33.
The square root of 90496032 is about 9512.9402394843. The cubic root of 90496032 is about 448.9622704956.
The spelling of 90496032 in words is "ninety million, four hundred ninety-six thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •