Base | Representation |
---|---|
bin | 1010110010110… |
… | …01101101100000 |
3 | 20022101011101020 |
4 | 11121121231200 |
5 | 141134414432 |
6 | 12552405440 |
7 | 2146422366 |
oct | 531315540 |
9 | 208334336 |
10 | 90544992 |
11 | 4712387a |
12 | 263a6880 |
13 | 159b3025 |
14 | c04d636 |
15 | 7e3822c |
hex | 5659b60 |
90544992 has 96 divisors (see below), whose sum is σ = 254469600. Its totient is φ = 28090368.
The previous prime is 90544991. The next prime is 90545003. The reversal of 90544992 is 29944509.
It is a tau number, because it is divible by the number of its divisors (96).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (90544991) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 177634 + ... + 178142.
It is an arithmetic number, because the mean of its divisors is an integer number (2650725).
Almost surely, 290544992 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 90544992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127234800).
90544992 is an abundant number, since it is smaller than the sum of its proper divisors (163924608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
90544992 is a wasteful number, since it uses less digits than its factorization.
90544992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 648 (or 640 counting only the distinct ones).
The product of its (nonzero) digits is 116640, while the sum is 42.
The square root of 90544992 is about 9515.5132284076. The cubic root of 90544992 is about 449.0432214847.
The spelling of 90544992 in words is "ninety million, five hundred forty-four thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •