Base | Representation |
---|---|
bin | 10001001000110110… |
… | …11011110011101101 |
3 | 212202020111121210112 |
4 | 20210123123303231 |
5 | 122320440344112 |
6 | 4121003345405 |
7 | 444004053245 |
oct | 104433336355 |
9 | 25666447715 |
10 | 9201106157 |
11 | 39a186a271 |
12 | 1949522265 |
13 | b38333c19 |
14 | 634004b25 |
15 | 38cba3a22 |
hex | 2246dbced |
9201106157 has 2 divisors, whose sum is σ = 9201106158. Its totient is φ = 9201106156.
The previous prime is 9201106151. The next prime is 9201106219. The reversal of 9201106157 is 7516011029.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8460504361 + 740601796 = 91981^2 + 27214^2 .
It is an emirp because it is prime and its reverse (7516011029) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 9201106157 - 24 = 9201106141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (9201106151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4600553078 + 4600553079.
It is an arithmetic number, because the mean of its divisors is an integer number (4600553079).
Almost surely, 29201106157 is an apocalyptic number.
It is an amenable number.
9201106157 is a deficient number, since it is larger than the sum of its proper divisors (1).
9201106157 is an equidigital number, since it uses as much as digits as its factorization.
9201106157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3780, while the sum is 32.
The square root of 9201106157 is about 95922.3965349073. The cubic root of 9201106157 is about 2095.4630819005.
The spelling of 9201106157 in words is "nine billion, two hundred one million, one hundred six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •