Base | Representation |
---|---|
bin | 1010110100110… |
… | …01110100000000 |
3 | 20022212111112200 |
4 | 11122121310000 |
5 | 141221320202 |
6 | 13002153200 |
7 | 2151565023 |
oct | 532316400 |
9 | 208774480 |
10 | 90807552 |
11 | 47293070 |
12 | 264b2800 |
13 | 15a756a4 |
14 | c0bb1ba |
15 | 7e8ae1c |
hex | 5699d00 |
90807552 has 108 divisors (see below), whose sum is σ = 285702144. Its totient is φ = 27509760.
The previous prime is 90807551. The next prime is 90807553. The reversal of 90807552 is 25570809.
It is an interprime number because it is at equal distance from previous prime (90807551) and next prime (90807553).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (90807551) 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, 23553 + ... + 27135.
Almost surely, 290807552 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 90807552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142851072).
90807552 is an abundant number, since it is smaller than the sum of its proper divisors (194894592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
90807552 is a wasteful number, since it uses less digits than its factorization.
90807552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3616 (or 3599 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 36.
The square root of 90807552 is about 9529.2996594713. The cubic root of 90807552 is about 449.4768438824.
The spelling of 90807552 in words is "ninety million, eight hundred seven thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •