Base | Representation |
---|---|
bin | 1010111010001… |
… | …10000101000000 |
3 | 20101012100110000 |
4 | 11131012011000 |
5 | 141411410102 |
6 | 13025240000 |
7 | 2160564123 |
oct | 535060500 |
9 | 211170400 |
10 | 91513152 |
11 | 47725205 |
12 | 26793000 |
13 | 15c618c3 |
14 | c2223ba |
15 | 807a01c |
hex | 5746140 |
91513152 has 140 divisors (see below), whose sum is σ = 275376640. Its totient is φ = 30046464.
The previous prime is 91513127. The next prime is 91513153. The reversal of 91513152 is 25131519.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (91513153) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 658299 + ... + 658437.
It is an arithmetic number, because the mean of its divisors is an integer number (1966976).
Almost surely, 291513152 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 91513152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (137688320).
91513152 is an abundant number, since it is smaller than the sum of its proper divisors (183863488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
91513152 is a wasteful number, since it uses less digits than its factorization.
91513152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 290 (or 271 counting only the distinct ones).
The product of its digits is 1350, while the sum is 27.
The square root of 91513152 is about 9566.2506762054. The cubic root of 91513152 is about 450.6380282834.
The spelling of 91513152 in words is "ninety-one million, five hundred thirteen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •