Base | Representation |
---|---|
bin | 10111111001110… |
… | …11010110110101 |
3 | 111222022112021221 |
4 | 23330323112311 |
5 | 402313134031 |
6 | 31521510341 |
7 | 4653254512 |
oct | 1374732665 |
9 | 458275257 |
10 | 200521141 |
11 | a3209557 |
12 | 571a23b1 |
13 | 3270a582 |
14 | 1c8ba309 |
15 | 1290da11 |
hex | bf3b5b5 |
200521141 has 2 divisors, whose sum is σ = 200521142. Its totient is φ = 200521140.
The previous prime is 200521081. The next prime is 200521157. The reversal of 200521141 is 141125002.
It is an a-pointer prime, because the next prime (200521157) can be obtained adding 200521141 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 197993041 + 2528100 = 14071^2 + 1590^2 .
It is a cyclic number.
It is not a de Polignac number, because 200521141 - 211 = 200519093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200521441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100260570 + 100260571.
It is an arithmetic number, because the mean of its divisors is an integer number (100260571).
Almost surely, 2200521141 is an apocalyptic number.
It is an amenable number.
200521141 is a deficient number, since it is larger than the sum of its proper divisors (1).
200521141 is an equidigital number, since it uses as much as digits as its factorization.
200521141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 80, while the sum is 16.
The square root of 200521141 is about 14160.5487534912. The cubic root of 200521141 is about 585.3110489406.
Adding to 200521141 its reverse (141125002), we get a palindrome (341646143).
The spelling of 200521141 in words is "two hundred million, five hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •