Base | Representation |
---|---|
bin | 10111110110111… |
… | …00100100111001 |
3 | 111221120210202102 |
4 | 23323130210321 |
5 | 402213223141 |
6 | 31505313145 |
7 | 4650046622 |
oct | 1373344471 |
9 | 457523672 |
10 | 200132921 |
11 | a2a7390a |
12 | 570357b5 |
13 | 32602961 |
14 | 1c818a49 |
15 | 1288399b |
hex | bedc939 |
200132921 has 2 divisors, whose sum is σ = 200132922. Its totient is φ = 200132920.
The previous prime is 200132917. The next prime is 200132927. The reversal of 200132921 is 129231002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 138980521 + 61152400 = 11789^2 + 7820^2 .
It is a cyclic number.
It is not a de Polignac number, because 200132921 - 22 = 200132917 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 200132893 and 200132902.
It is not a weakly prime, because it can be changed into another prime (200132927) 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, 100066460 + 100066461.
It is an arithmetic number, because the mean of its divisors is an integer number (100066461).
Almost surely, 2200132921 is an apocalyptic number.
It is an amenable number.
200132921 is a deficient number, since it is larger than the sum of its proper divisors (1).
200132921 is an equidigital number, since it uses as much as digits as its factorization.
200132921 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
The square root of 200132921 is about 14146.8343101911. The cubic root of 200132921 is about 584.9330734062.
Adding to 200132921 its reverse (129231002), we get a palindrome (329363923).
The spelling of 200132921 in words is "two hundred million, one hundred thirty-two thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •