Base | Representation |
---|---|
bin | 101101011111110111101100… |
… | …101011101010001010100101 |
3 | 222020111120202112010211102001 |
4 | 231133313230223222022211 |
5 | 202211433302232034341 |
6 | 1545325403241445301 |
7 | 60101623053003166 |
oct | 5537675453521245 |
9 | 866446675124361 |
10 | 200102202221221 |
11 | 5883895a555893 |
12 | 1a5391927a0831 |
13 | 87867310c9cb1 |
14 | 375add933d76d |
15 | 18201b67d3d31 |
hex | b5fdecaea2a5 |
200102202221221 has 16 divisors (see below), whose sum is σ = 204931825338240. Its totient is φ = 195313967259840.
The previous prime is 200102202221203. The next prime is 200102202221279. The reversal of 200102202221221 is 122122202201002.
It is a cyclic number.
It is not a de Polignac number, because 200102202221221 - 29 = 200102202220709 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200102202221281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2416401 + ... + 20150518.
It is an arithmetic number, because the mean of its divisors is an integer number (12808239083640).
Almost surely, 2200102202221221 is an apocalyptic number.
It is an amenable number.
200102202221221 is a deficient number, since it is larger than the sum of its proper divisors (4829623117019).
200102202221221 is a wasteful number, since it uses less digits than its factorization.
200102202221221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22567836.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 200102202221221 its reverse (122122202201002), we get a palindrome (322224404422223).
The spelling of 200102202221221 in words is "two hundred trillion, one hundred two billion, two hundred two million, two hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •