Base | Representation |
---|---|
bin | 1011101001110011101… |
… | …1000000110101010101 |
3 | 201010202100220021101212 |
4 | 2322130323000311111 |
5 | 11240003002224341 |
6 | 231545434431205 |
7 | 20315113134434 |
oct | 2723473006525 |
9 | 633670807355 |
10 | 200201211221 |
11 | 779a5401170 |
12 | 32972b92505 |
13 | 15b56c0b87b |
14 | 9992adb11b |
15 | 531ae6c5eb |
hex | 2e9cec0d55 |
200201211221 has 4 divisors (see below), whose sum is σ = 218401321344. Its totient is φ = 182001101100.
The previous prime is 200201211187. The next prime is 200201211253. The reversal of 200201211221 is 122112102002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 200201211221 - 210 = 200201210197 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200201211196 and 200201211205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200201211281) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9100055045 + ... + 9100055066.
It is an arithmetic number, because the mean of its divisors is an integer number (54600330336).
Almost surely, 2200201211221 is an apocalyptic number.
It is an amenable number.
200201211221 is a deficient number, since it is larger than the sum of its proper divisors (18200110123).
200201211221 is a wasteful number, since it uses less digits than its factorization.
200201211221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18200110122.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 200201211221 its reverse (122112102002), we get a palindrome (322313313223).
The spelling of 200201211221 in words is "two hundred billion, two hundred one million, two hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •