Base | Representation |
---|---|
bin | 101010011010111001… |
… | …0100111001000000000 |
3 | 22201010200122120000000 |
4 | 1110311302213020000 |
5 | 2443031233214440 |
6 | 105503240000000 |
7 | 6403314536553 |
oct | 1246562471000 |
9 | 281120576000 |
10 | 91096773120 |
11 | 356a7831a61 |
12 | 157a4160000 |
13 | 878a113262 |
14 | 45a283a69a |
15 | 25827c6730 |
hex | 1535ca7200 |
91096773120 has 640 divisors, whose sum is σ = 334846068480. Its totient is φ = 23756488704.
The previous prime is 91096773083. The next prime is 91096773137. The reversal of 91096773120 is 2137769019.
It is a tau number, because it is divible by the number of its divisors (640).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 296732007 + ... + 296732313.
It is an arithmetic number, because the mean of its divisors is an integer number (523196982).
Almost surely, 291096773120 is an apocalyptic number.
91096773120 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 91096773120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167423034240).
91096773120 is an abundant number, since it is smaller than the sum of its proper divisors (243749295360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
91096773120 is an frugal number, since it uses more digits than its factorization.
91096773120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404 (or 370 counting only the distinct ones).
The product of its (nonzero) digits is 142884, while the sum is 45.
The spelling of 91096773120 in words is "ninety-one billion, ninety-six million, seven hundred seventy-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •