Base | Representation |
---|---|
bin | 101010001100110101… |
… | …1010000000100000000 |
3 | 22122220211002010212201 |
4 | 1110121223100010000 |
5 | 2441100010102400 |
6 | 105344350002544 |
7 | 6355526324614 |
oct | 1243153200400 |
9 | 278824063781 |
10 | 90625081600 |
11 | 35485550159 |
12 | 156921a6454 |
13 | 8713490251 |
14 | 4559d33344 |
15 | 25561a106a |
hex | 1519ad0100 |
90625081600 has 243 divisors, whose sum is σ = 231888779479. Its totient is φ = 35065139200.
The previous prime is 90625081531. The next prime is 90625081607. The reversal of 90625081600 is 618052609.
The square root of 90625081600 is 301040.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 682672384 + 89942409216 = 26128^2 + 299904^2 .
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 90625081600.
It is not an unprimeable number, because it can be changed into a prime (90625081607) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 1276409565 + ... + 1276409635.
Almost surely, 290625081600 is an apocalyptic number.
90625081600 is the 301040-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 90625081600
90625081600 is an abundant number, since it is smaller than the sum of its proper divisors (141263697879).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
90625081600 is an frugal number, since it uses more digits than its factorization.
90625081600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 274 (or 131 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 37.
The spelling of 90625081600 in words is "ninety billion, six hundred twenty-five million, eighty-one thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •