Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100110001001001110001001 |
3 | 222020212222120220021112021221 |
4 | 231201131001212021032021 |
5 | 202220224112230140241 |
6 | 1545451355241402041 |
7 | 60112524150360133 |
oct | 5541350146111611 |
9 | 866788526245257 |
10 | 200211001021321 |
11 | 5888001064a704 |
12 | 1a556297199321 |
13 | 8793a7c7a2514 |
14 | 376239aba0053 |
15 | 1822e332055d1 |
hex | b61741989389 |
200211001021321 has 2 divisors, whose sum is σ = 200211001021322. Its totient is φ = 200211001021320.
The previous prime is 200211001021309. The next prime is 200211001021327. The reversal of 200211001021321 is 123120100112002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 114084508671225 + 86126492350096 = 10681035^2 + 9280436^2 .
It is a cyclic number.
It is not a de Polignac number, because 200211001021321 - 225 = 200210967466889 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200211001021295 and 200211001021304.
It is not a weakly prime, because it can be changed into another prime (200211001021327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105500510660 + 100105500510661.
It is an arithmetic number, because the mean of its divisors is an integer number (100105500510661).
Almost surely, 2200211001021321 is an apocalyptic number.
It is an amenable number.
200211001021321 is a deficient number, since it is larger than the sum of its proper divisors (1).
200211001021321 is an equidigital number, since it uses as much as digits as its factorization.
200211001021321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 200211001021321 its reverse (123120100112002), we get a palindrome (323331101133323).
The spelling of 200211001021321 in words is "two hundred trillion, two hundred eleven billion, one million, twenty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •