Base | Representation |
---|---|
bin | 1011101001110011111… |
… | …0000100001001010101 |
3 | 201010202102101220210111 |
4 | 2322130332010021111 |
5 | 11240003203324341 |
6 | 231545503523021 |
7 | 20315123006002 |
oct | 2723476041125 |
9 | 633672356714 |
10 | 200202011221 |
11 | 779a58a8223 |
12 | 329732b9471 |
13 | 15b5712ba44 |
14 | 9992c688a9 |
15 | 531b079681 |
hex | 2e9cf84255 |
200202011221 has 16 divisors (see below), whose sum is σ = 212437209600. Its totient is φ = 188138984688.
The previous prime is 200202011197. The next prime is 200202011287. The reversal of 200202011221 is 122110202002.
It is a happy number.
200202011221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 200202011221 - 25 = 200202011189 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 (200202011291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3102936 + ... + 3166798.
It is an arithmetic number, because the mean of its divisors is an integer number (13277325600).
Almost surely, 2200202011221 is an apocalyptic number.
It is an amenable number.
200202011221 is a deficient number, since it is larger than the sum of its proper divisors (12235198379).
200202011221 is a wasteful number, since it uses less digits than its factorization.
200202011221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65208.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 200202011221 its reverse (122110202002), we get a palindrome (322312213223).
The spelling of 200202011221 in words is "two hundred billion, two hundred two million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •