Base | Representation |
---|---|
bin | 101010000010010011… |
… | …0100100011010011100 |
3 | 22122000011210222222000 |
4 | 1110010212210122130 |
5 | 2434334003021300 |
6 | 105245320122300 |
7 | 6344004240036 |
oct | 1240446443234 |
9 | 278004728860 |
10 | 90271532700 |
11 | 35313a21688 |
12 | 155b3906390 |
13 | 868816390b |
14 | 4524dc0c56 |
15 | 2535115c00 |
hex | 15049a469c |
90271532700 has 576 divisors, whose sum is σ = 316029772800. Its totient is φ = 22029926400.
The previous prime is 90271532683. The next prime is 90271532749. The reversal of 90271532700 is 723517209.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 351250972 + ... + 351251228.
It is an arithmetic number, because the mean of its divisors is an integer number (548662800).
Almost surely, 290271532700 is an apocalyptic number.
90271532700 is a gapful number since it is divisible by the number (90) 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 90271532700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (158014886400).
90271532700 is an abundant number, since it is smaller than the sum of its proper divisors (225758240100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
90271532700 is a wasteful number, since it uses less digits than its factorization.
90271532700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 507 (or 494 counting only the distinct ones).
The product of its (nonzero) digits is 26460, while the sum is 36.
The spelling of 90271532700 in words is "ninety billion, two hundred seventy-one million, five hundred thirty-two thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •