Base | Representation |
---|---|
bin | 10111110110010… |
… | …01000110011111 |
3 | 111221102202022222 |
4 | 23323021012133 |
5 | 402203200101 |
6 | 31503455555 |
7 | 4646265224 |
oct | 1373110637 |
9 | 457382288 |
10 | 200053151 |
11 | a2a19991 |
12 | 56bb75bb |
13 | 325a555c |
14 | 1c7d794b |
15 | 1286a01b |
hex | bec919f |
200053151 has 2 divisors, whose sum is σ = 200053152. Its totient is φ = 200053150.
The previous prime is 200053097. The next prime is 200053153. The reversal of 200053151 is 151350002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200053151 - 222 = 195858847 is a prime.
It is a Sophie Germain prime.
Together with 200053153, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200053153) 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 as a sum of consecutive naturals, namely, 100026575 + 100026576.
It is an arithmetic number, because the mean of its divisors is an integer number (100026576).
Almost surely, 2200053151 is an apocalyptic number.
200053151 is a deficient number, since it is larger than the sum of its proper divisors (1).
200053151 is an equidigital number, since it uses as much as digits as its factorization.
200053151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 150, while the sum is 17.
The square root of 200053151 is about 14144.0146705241. The cubic root of 200053151 is about 584.8553478764.
The spelling of 200053151 in words is "two hundred million, fifty-three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •