Base | Representation |
---|---|
bin | 1010110111100… |
… | …10010100000000 |
3 | 20100112220210110 |
4 | 11123302110000 |
5 | 141314420143 |
6 | 13014031320 |
7 | 2154634614 |
oct | 533622400 |
9 | 210486713 |
10 | 91170048 |
11 | 47510452 |
12 | 26648540 |
13 | 15b71698 |
14 | c173344 |
15 | 800d533 |
hex | 56f2500 |
91170048 has 72 divisors (see below), whose sum is σ = 256955328. Its totient is φ = 28598272.
The previous prime is 91170047. The next prime is 91170073. The reversal of 91170048 is 84007119.
It is a junction number, because it is equal to n+sod(n) for n = 91169997 and 91170024.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (91170041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9565 + ... + 16547.
It is an arithmetic number, because the mean of its divisors is an integer number (3568824).
Almost surely, 291170048 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 91170048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128477664).
91170048 is an abundant number, since it is smaller than the sum of its proper divisors (165785280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
91170048 is a wasteful number, since it uses less digits than its factorization.
91170048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7019 (or 7005 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 30.
The square root of 91170048 is about 9548.3007912403. The cubic root of 91170048 is about 450.0741408705.
The spelling of 91170048 in words is "ninety-one million, one hundred seventy thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •