Base | Representation |
---|---|
bin | 1010110101010… |
… | …00001110100000 |
3 | 20022222111112100 |
4 | 11122220032200 |
5 | 141230212332 |
6 | 13003330400 |
7 | 2152232115 |
oct | 532501640 |
9 | 208874470 |
10 | 90866592 |
11 | 47323463 |
12 | 26520a00 |
13 | 15a9651b |
14 | c0d490c |
15 | 7e9d67c |
hex | 56a83a0 |
90866592 has 72 divisors (see below), whose sum is σ = 263321604. Its totient is φ = 29712384.
The previous prime is 90866591. The next prime is 90866609. The reversal of 90866592 is 29566809.
It can be written as a sum of positive squares in 2 ways, for example, as 86044176 + 4822416 = 9276^2 + 2196^2 .
It is a tau number, because it is divible by the number of its divisors (72).
It is not an unprimeable number, because it can be changed into a prime (90866591) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 12288 + ... + 18240.
Almost surely, 290866592 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 90866592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (131660802).
90866592 is an abundant number, since it is smaller than the sum of its proper divisors (172455012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
90866592 is a wasteful number, since it uses less digits than its factorization.
90866592 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6022 (or 6011 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 45.
The square root of 90866592 is about 9532.3969703323. The cubic root of 90866592 is about 449.5742343276.
The spelling of 90866592 in words is "ninety million, eight hundred sixty-six thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •