Base | Representation |
---|---|
bin | 101010110100110100… |
… | …0100100001111110000 |
3 | 22210101022022001121011 |
4 | 1111221220210033300 |
5 | 3001321414230440 |
6 | 110125430240304 |
7 | 6434005551256 |
oct | 1255150441760 |
9 | 283338261534 |
10 | 91966555120 |
11 | 360037a5060 |
12 | 159a74b6094 |
13 | 889838966b |
14 | 464616c5d6 |
15 | 25d3d349ea |
hex | 1569a243f0 |
91966555120 has 160 divisors (see below), whose sum is σ = 249760532160. Its totient is φ = 31121080320.
The previous prime is 91966555099. The next prime is 91966555147. The reversal of 91966555120 is 2155566919.
It is a super-3 number, since 3×919665551203 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1296904 + ... + 1365976.
It is an arithmetic number, because the mean of its divisors is an integer number (1561003326).
Almost surely, 291966555120 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 91966555120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (124880266080).
91966555120 is an abundant number, since it is smaller than the sum of its proper divisors (157793977040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
91966555120 is a wasteful number, since it uses less digits than its factorization.
91966555120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69203 (or 69197 counting only the distinct ones).
The product of its (nonzero) digits is 729000, while the sum is 49.
The spelling of 91966555120 in words is "ninety-one billion, nine hundred sixty-six million, five hundred fifty-five thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •