Base | Representation |
---|---|
bin | 101010011111000000… |
… | …0011000010011000000 |
3 | 22201111021222220010000 |
4 | 1110332000120103000 |
5 | 2443322024201003 |
6 | 105525042040000 |
7 | 6406610206560 |
oct | 1247600302300 |
9 | 281437886100 |
10 | 91234600128 |
11 | 3576860a481 |
12 | 15822349000 |
13 | 87ac83c4b9 |
14 | 45b6c76da0 |
15 | 258e94e1a3 |
hex | 153e0184c0 |
91234600128 has 560 divisors, whose sum is σ = 332033416704. Its totient is φ = 24176517120.
The previous prime is 91234600117. The next prime is 91234600153. The reversal of 91234600128 is 82100643219.
91234600128 is a `hidden beast` number, since 9 + 1 + 2 + 34 + 600 + 12 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 91234600092 and 91234600101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 43798575 + ... + 43800657.
Almost surely, 291234600128 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 91234600128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166016708352).
91234600128 is an abundant number, since it is smaller than the sum of its proper divisors (240798816576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
91234600128 is a wasteful number, since it uses less digits than its factorization.
91234600128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2202 (or 2183 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
The spelling of 91234600128 in words is "ninety-one billion, two hundred thirty-four million, six hundred thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •