Base | Representation |
---|---|
bin | 1011101101001111100… |
… | …0011110001111111101 |
3 | 201020010121221211122122 |
4 | 2323103320132033331 |
5 | 11243400030322112 |
6 | 232221134052325 |
7 | 20350010530154 |
oct | 2732370361775 |
9 | 636117854578 |
10 | 201123292157 |
11 | 78328945227 |
12 | 32b8b94a0a5 |
13 | 15c72c668a8 |
14 | 9a3d36459b |
15 | 5371dab872 |
hex | 2ed3e1e3fd |
201123292157 has 2 divisors, whose sum is σ = 201123292158. Its totient is φ = 201123292156.
The previous prime is 201123292121. The next prime is 201123292163. The reversal of 201123292157 is 751292321102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 160485167236 + 40638124921 = 400606^2 + 201589^2 .
It is a cyclic number.
It is not a de Polignac number, because 201123292157 - 222 = 201119097853 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201123292177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100561646078 + 100561646079.
It is an arithmetic number, because the mean of its divisors is an integer number (100561646079).
Almost surely, 2201123292157 is an apocalyptic number.
It is an amenable number.
201123292157 is a deficient number, since it is larger than the sum of its proper divisors (1).
201123292157 is an equidigital number, since it uses as much as digits as its factorization.
201123292157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 35.
The spelling of 201123292157 in words is "two hundred one billion, one hundred twenty-three million, two hundred ninety-two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •