Base | Representation |
---|---|
bin | 101010100100111001… |
… | …0010110011010000000 |
3 | 22202000001220111100010 |
4 | 1111021302112122000 |
5 | 2444223123431320 |
6 | 110000422224520 |
7 | 6414530202333 |
oct | 1251162263200 |
9 | 282001814303 |
10 | 91432248960 |
11 | 3585a136a18 |
12 | 15878585140 |
13 | 8811782580 |
14 | 45d520661a |
15 | 25a1e91ae0 |
hex | 1549c96680 |
91432248960 has 512 divisors, whose sum is σ = 322019712000. Its totient is φ = 21929656320.
The previous prime is 91432248949. The next prime is 91432248961. The reversal of 91432248960 is 6984223419.
It is a super-2 number, since 2×914322489602 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (91432248961) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 175493500 + ... + 175494020.
It is an arithmetic number, because the mean of its divisors is an integer number (628944750).
Almost surely, 291432248960 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 91432248960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (161009856000).
91432248960 is an abundant number, since it is smaller than the sum of its proper divisors (230587463040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
91432248960 is a wasteful number, since it uses less digits than its factorization.
91432248960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 724 (or 712 counting only the distinct ones).
The product of its (nonzero) digits is 746496, while the sum is 48.
The spelling of 91432248960 in words is "ninety-one billion, four hundred thirty-two million, two hundred forty-eight thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •