Base | Representation |
---|---|
bin | 1010110010101… |
… | …01111110000000 |
3 | 20022100101100112 |
4 | 11121111332000 |
5 | 141133422124 |
6 | 12552210452 |
7 | 2146326611 |
oct | 531257600 |
9 | 208311315 |
10 | 90529664 |
11 | 47113305 |
12 | 26399a28 |
13 | 159a9064 |
14 | c047c08 |
15 | 7e3390e |
hex | 5655f80 |
90529664 has 32 divisors (see below), whose sum is σ = 181804800. Its totient is φ = 44900352.
The previous prime is 90529657. The next prime is 90529667. The reversal of 90529664 is 46692509.
It is a tau number, because it is divible by the number of its divisors (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (90529667) 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 3 ways as a sum of consecutive naturals, for example, 13472 + ... + 19040.
It is an arithmetic number, because the mean of its divisors is an integer number (5681400).
Almost surely, 290529664 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 90529664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (90902400).
90529664 is an abundant number, since it is smaller than the sum of its proper divisors (91275136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
90529664 is a wasteful number, since it uses less digits than its factorization.
90529664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5710 (or 5698 counting only the distinct ones).
The product of its (nonzero) digits is 116640, while the sum is 41.
The square root of 90529664 is about 9514.7077727064. The cubic root of 90529664 is about 449.0178811436.
The spelling of 90529664 in words is "ninety million, five hundred twenty-nine thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •