Base | Representation |
---|---|
bin | 1011101001111000001… |
… | …1000100110111110101 |
3 | 201010210200110000212021 |
4 | 2322132003010313311 |
5 | 11240022321232013 |
6 | 231551351353141 |
7 | 20315432534122 |
oct | 2723603046765 |
9 | 633720400767 |
10 | 200220102133 |
11 | 77a05034197 |
12 | 329793827b1 |
13 | 15b5aac421c |
14 | 9995417749 |
15 | 531c94ea8d |
hex | 2e9e0c4df5 |
200220102133 has 2 divisors, whose sum is σ = 200220102134. Its totient is φ = 200220102132.
The previous prime is 200220102097. The next prime is 200220102151. The reversal of 200220102133 is 331201022002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 128180468529 + 72039633604 = 358023^2 + 268402^2 .
It is a cyclic number.
It is not a de Polignac number, because 200220102133 - 229 = 199683231221 is a prime.
It is a super-2 number, since 2×2002201021332 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200220102193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100110051066 + 100110051067.
It is an arithmetic number, because the mean of its divisors is an integer number (100110051067).
Almost surely, 2200220102133 is an apocalyptic number.
It is an amenable number.
200220102133 is a deficient number, since it is larger than the sum of its proper divisors (1).
200220102133 is an equidigital number, since it uses as much as digits as its factorization.
200220102133 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 16.
Adding to 200220102133 its reverse (331201022002), we get a palindrome (531421124135).
The spelling of 200220102133 in words is "two hundred billion, two hundred twenty million, one hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •