Base | Representation |
---|---|
bin | 101010100001010100… |
… | …0000101000100100000 |
3 | 22201200200212002220020 |
4 | 1111002220011010200 |
5 | 2444001400203000 |
6 | 105540451313440 |
7 | 6411541115430 |
oct | 1250250050440 |
9 | 281620762806 |
10 | 91312116000 |
11 | 357a8344286 |
12 | 158442ab880 |
13 | 87c290cc91 |
14 | 45c32942c0 |
15 | 2596661ba0 |
hex | 1542a05120 |
91312116000 has 768 divisors, whose sum is σ = 360246362112. Its totient is φ = 19768320000.
The previous prime is 91312115899. The next prime is 91312116019. The reversal of 91312116000 is 61121319.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
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 127 ways as a sum of consecutive naturals, for example, 291731844 + ... + 291732156.
It is an arithmetic number, because the mean of its divisors is an integer number (469070784).
Almost surely, 291312116000 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 91312116000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (180123181056).
91312116000 is an abundant number, since it is smaller than the sum of its proper divisors (268934246112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
91312116000 is a wasteful number, since it uses less digits than its factorization.
91312116000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 522 (or 504 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 24.
Adding to 91312116000 its reverse (61121319), we get a palindrome (91373237319).
The spelling of 91312116000 in words is "ninety-one billion, three hundred twelve million, one hundred sixteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •