Base | Representation |
---|---|
bin | 101010011010000001… |
… | …0111100011000010010 |
3 | 22201001122120022220020 |
4 | 1110310002330120102 |
5 | 2443001240000200 |
6 | 105500312324310 |
7 | 6402510656412 |
oct | 1246402743022 |
9 | 281048508806 |
10 | 91067500050 |
11 | 3569225873a |
12 | 157963a3696 |
13 | 8784034107 |
14 | 459c9ba642 |
15 | 257ee42ea0 |
hex | 15340bc612 |
91067500050 has 96 divisors (see below), whose sum is σ = 229838592960. Its totient is φ = 23856096000.
The previous prime is 91067500049. The next prime is 91067500063. The reversal of 91067500050 is 5000576019.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 91067499984 and 91067500020.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 16821144 + ... + 16826556.
It is an arithmetic number, because the mean of its divisors is an integer number (2394152010).
Almost surely, 291067500050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 91067500050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (114919296480).
91067500050 is an abundant number, since it is smaller than the sum of its proper divisors (138771092910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
91067500050 is a wasteful number, since it uses less digits than its factorization.
91067500050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7388 (or 7383 counting only the distinct ones).
The product of its (nonzero) digits is 9450, while the sum is 33.
The spelling of 91067500050 in words is "ninety-one billion, sixty-seven million, five hundred thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •