Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100110001001001011011011 |
3 | 222020212222120220021112001111 |
4 | 231201131001212021023123 |
5 | 202220224112230134042 |
6 | 1545451355241401151 |
7 | 60112524150356464 |
oct | 5541350146111333 |
9 | 866788526245044 |
10 | 200211001021147 |
11 | 5888001064a566 |
12 | 1a5562971991b7 |
13 | 8793a7c7a240c |
14 | 376239ab9dd6b |
15 | 1822e33205517 |
hex | b617419892db |
200211001021147 has 2 divisors, whose sum is σ = 200211001021148. Its totient is φ = 200211001021146.
The previous prime is 200211001021121. The next prime is 200211001021169. The reversal of 200211001021147 is 741120100112002.
It is a happy number.
It is an a-pointer prime, because the next prime (200211001021169) can be obtained adding 200211001021147 to its sum of digits (22).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200211001021147 - 215 = 200211000988379 is a prime.
It is not a weakly prime, because it can be changed into another prime (200211001061147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105500510573 + 100105500510574.
It is an arithmetic number, because the mean of its divisors is an integer number (100105500510574).
Almost surely, 2200211001021147 is an apocalyptic number.
200211001021147 is a deficient number, since it is larger than the sum of its proper divisors (1).
200211001021147 is an equidigital number, since it uses as much as digits as its factorization.
200211001021147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 200211001021147 its reverse (741120100112002), we get a palindrome (941331101133149).
The spelling of 200211001021147 in words is "two hundred trillion, two hundred eleven billion, one million, twenty-one thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •