Base | Representation |
---|---|
bin | 10111110111011… |
… | …11101010110001 |
3 | 111221201210000201 |
4 | 23323233222301 |
5 | 402223223441 |
6 | 31511115201 |
7 | 4650523615 |
oct | 1373575261 |
9 | 457653021 |
10 | 200211121 |
11 | a3017640 |
12 | 57072b01 |
13 | 3262c426 |
14 | 1c839345 |
15 | 1289bc31 |
hex | beefab1 |
200211121 has 4 divisors (see below), whose sum is σ = 218412144. Its totient is φ = 182010100.
The previous prime is 200211103. The next prime is 200211127. The reversal of 200211121 is 121112002.
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 200211121 - 27 = 200210993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200211098 and 200211107.
It is not an unprimeable number, because it can be changed into a prime (200211127) 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 3 ways as a sum of consecutive naturals, for example, 9100495 + ... + 9100516.
It is an arithmetic number, because the mean of its divisors is an integer number (54603036).
Almost surely, 2200211121 is an apocalyptic number.
It is an amenable number.
200211121 is a deficient number, since it is larger than the sum of its proper divisors (18201023).
200211121 is a wasteful number, since it uses less digits than its factorization.
200211121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18201022.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 200211121 is about 14149.5979094814. The cubic root of 200211121 is about 585.0092491293.
Adding to 200211121 its reverse (121112002), we get a palindrome (321323123).
The spelling of 200211121 in words is "two hundred million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •