Base | Representation |
---|---|
bin | 1010110110011… |
… | …11011011001011 |
3 | 20100021122202211 |
4 | 11123033123023 |
5 | 141300332042 |
6 | 13011005551 |
7 | 2153501161 |
oct | 533173313 |
9 | 210248684 |
10 | 91027147 |
11 | 47423052 |
12 | 265998b7 |
13 | 15b21623 |
14 | c137231 |
15 | 7ed1017 |
hex | 56cf6cb |
91027147 has 8 divisors (see below), whose sum is σ = 93441600. Its totient is φ = 88641864.
The previous prime is 91027127. The next prime is 91027171. The reversal of 91027147 is 74172019.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 91027147 - 219 = 90502859 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (91027127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 897 + ... + 13522.
It is an arithmetic number, because the mean of its divisors is an integer number (11680200).
Almost surely, 291027147 is an apocalyptic number.
91027147 is a deficient number, since it is larger than the sum of its proper divisors (2414453).
91027147 is a wasteful number, since it uses less digits than its factorization.
91027147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14585.
The product of its (nonzero) digits is 3528, while the sum is 31.
The square root of 91027147 is about 9540.8147974898. The cubic root of 91027147 is about 449.8388674126.
The spelling of 91027147 in words is "ninety-one million, twenty-seven thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •