Base | Representation |
---|---|
bin | 10111110010000… |
… | …10010101100101 |
3 | 111220101201010202 |
4 | 23321002111211 |
5 | 402033014112 |
6 | 31444000245 |
7 | 4641506012 |
oct | 1371022545 |
9 | 456351122 |
10 | 199501157 |
11 | a2682199 |
12 | 56990085 |
13 | 3244122b |
14 | 1c6d2709 |
15 | 127ab6c2 |
hex | be42565 |
199501157 has 2 divisors, whose sum is σ = 199501158. Its totient is φ = 199501156.
The previous prime is 199501139. The next prime is 199501177. The reversal of 199501157 is 751105991.
199501157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 186295201 + 13205956 = 13649^2 + 3634^2 .
It is an emirp because it is prime and its reverse (751105991) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-199501157 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 199501157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (199501117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 99750578 + 99750579.
It is an arithmetic number, because the mean of its divisors is an integer number (99750579).
Almost surely, 2199501157 is an apocalyptic number.
It is an amenable number.
199501157 is a deficient number, since it is larger than the sum of its proper divisors (1).
199501157 is an equidigital number, since it uses as much as digits as its factorization.
199501157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14175, while the sum is 38.
The square root of 199501157 is about 14124.4878491222. The cubic root of 199501157 is about 584.3169342517.
The spelling of 199501157 in words is "one hundred ninety-nine million, five hundred one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •