Base | Representation |
---|---|
bin | 101101100001100101011010… |
… | …000010011010110010110101 |
3 | 222020220211211010100220000102 |
4 | 231201211122002122302311 |
5 | 202220401030230133414 |
6 | 1545455444302523445 |
7 | 60113263163200436 |
oct | 5541453202326265 |
9 | 866824733326012 |
10 | 200220001021109 |
11 | 58883909940763 |
12 | 1a557b89296585 |
13 | 8794885252694 |
14 | 37629b21b548d |
15 | 18232ad3d1ede |
hex | b6195a09acb5 |
200220001021109 has 2 divisors, whose sum is σ = 200220001021110. Its totient is φ = 200220001021108.
The previous prime is 200220001021093. The next prime is 200220001021171. The reversal of 200220001021109 is 901120100022002.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 116123361363025 + 84096639658084 = 10776055^2 + 9170422^2 .
It is a cyclic number.
It is not a de Polignac number, because 200220001021109 - 24 = 200220001021093 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200220001011109) 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, 100110000510554 + 100110000510555.
It is an arithmetic number, because the mean of its divisors is an integer number (100110000510555).
Almost surely, 2200220001021109 is an apocalyptic number.
It is an amenable number.
200220001021109 is a deficient number, since it is larger than the sum of its proper divisors (1).
200220001021109 is an equidigital number, since it uses as much as digits as its factorization.
200220001021109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
The spelling of 200220001021109 in words is "two hundred trillion, two hundred twenty billion, one million, twenty-one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •