Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100110001001010111110001 |
3 | 222020212222120220021120010202 |
4 | 231201131001212021113301 |
5 | 202220224112230200222 |
6 | 1545451355241404545 |
7 | 60112524150362003 |
oct | 5541350146112761 |
9 | 866788526246122 |
10 | 200211001021937 |
11 | 58880010650114 |
12 | 1a556297199755 |
13 | 8793a7c7a2899 |
14 | 376239aba0373 |
15 | 1822e33205892 |
hex | b617419895f1 |
200211001021937 has 2 divisors, whose sum is σ = 200211001021938. Its totient is φ = 200211001021936.
The previous prime is 200211001021919. The next prime is 200211001021951. The reversal of 200211001021937 is 739120100112002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 199630929904561 + 580071117376 = 14129081^2 + 761624^2 .
It is a cyclic number.
It is not a de Polignac number, because 200211001021937 - 216 = 200211000956401 is a prime.
It is not a weakly prime, because it can be changed into another prime (200211001051937) 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, 100105500510968 + 100105500510969.
It is an arithmetic number, because the mean of its divisors is an integer number (100105500510969).
Almost surely, 2200211001021937 is an apocalyptic number.
It is an amenable number.
200211001021937 is a deficient number, since it is larger than the sum of its proper divisors (1).
200211001021937 is an equidigital number, since it uses as much as digits as its factorization.
200211001021937 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 29.
Adding to 200211001021937 its reverse (739120100112002), we get a palindrome (939331101133939).
The spelling of 200211001021937 in words is "two hundred trillion, two hundred eleven billion, one million, twenty-one thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •