Base | Representation |
---|---|
bin | 1010110101100… |
… | …10100100101100 |
3 | 20100001122122222 |
4 | 11122302210230 |
5 | 141233041342 |
6 | 13004254512 |
7 | 2152466510 |
oct | 532624454 |
9 | 210048588 |
10 | 90908972 |
11 | 47352290 |
12 | 26541438 |
13 | 15aac8bb |
14 | c106140 |
15 | 7eaaed2 |
hex | 56b292c |
90908972 has 96 divisors (see below), whose sum is σ = 212696064. Its totient is φ = 32947200.
The previous prime is 90908959. The next prime is 90909031. The reversal of 90908972 is 27980909.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 290288 + ... + 290600.
It is an arithmetic number, because the mean of its divisors is an integer number (2215584).
Almost surely, 290908972 is an apocalyptic number.
90908972 is a gapful number since it is divisible by the number (92) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 90908972, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106348032).
90908972 is an abundant number, since it is smaller than the sum of its proper divisors (121787092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
90908972 is a wasteful number, since it uses less digits than its factorization.
90908972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 399 (or 397 counting only the distinct ones).
The product of its (nonzero) digits is 81648, while the sum is 44.
The square root of 90908972 is about 9534.6196568086. The cubic root of 90908972 is about 449.6441169776.
The spelling of 90908972 in words is "ninety million, nine hundred eight thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •