Base | Representation |
---|---|
bin | 1010111001011… |
… | …10011100100000 |
3 | 20101000102122211 |
4 | 11130232130200 |
5 | 141400310402 |
6 | 13023211504 |
7 | 2160011656 |
oct | 534563440 |
9 | 211012584 |
10 | 91416352 |
11 | 47669505 |
12 | 26746b94 |
13 | 15c29821 |
14 | c1d8dd6 |
15 | 805b4d7 |
hex | 572e720 |
91416352 has 48 divisors (see below), whose sum is σ = 194322240. Its totient is φ = 42203392.
The previous prime is 91416349. The next prime is 91416359. The reversal of 91416352 is 25361419.
It is not an unprimeable number, because it can be changed into a prime (91416359) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 19203 + ... + 23485.
It is an arithmetic number, because the mean of its divisors is an integer number (4048380).
Almost surely, 291416352 is an apocalyptic number.
91416352 is a gapful number since it is divisible by the number (92) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 91416352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (97161120).
91416352 is an abundant number, since it is smaller than the sum of its proper divisors (102905888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
91416352 is a wasteful number, since it uses less digits than its factorization.
91416352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4345 (or 4337 counting only the distinct ones).
The product of its digits is 6480, while the sum is 31.
The square root of 91416352 is about 9561.1898841096. The cubic root of 91416352 is about 450.4790815460.
The spelling of 91416352 in words is "ninety-one million, four hundred sixteen thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •