Base | Representation |
---|---|
bin | 10111111101001… |
… | …01010100001111 |
3 | 112000010120122101 |
4 | 23332211110033 |
5 | 402421031101 |
6 | 31535055531 |
7 | 4660043035 |
oct | 1376452417 |
9 | 460116571 |
10 | 200955151 |
11 | a3485641 |
12 | 573715a7 |
13 | 3282cc97 |
14 | 1c990555 |
15 | 12997401 |
hex | bfa550f |
200955151 has 2 divisors, whose sum is σ = 200955152. Its totient is φ = 200955150.
The previous prime is 200955149. The next prime is 200955233. The reversal of 200955151 is 151559002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200955151 - 21 = 200955149 is a prime.
Together with 200955149, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200955451) 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, 100477575 + 100477576.
It is an arithmetic number, because the mean of its divisors is an integer number (100477576).
Almost surely, 2200955151 is an apocalyptic number.
200955151 is a deficient number, since it is larger than the sum of its proper divisors (1).
200955151 is an equidigital number, since it uses as much as digits as its factorization.
200955151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2250, while the sum is 28.
The square root of 200955151 is about 14175.8650882406. The cubic root of 200955151 is about 585.7330290396.
The spelling of 200955151 in words is "two hundred million, nine hundred fifty-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •