Base | Representation |
---|---|
bin | 1011101001110011101… |
… | …0101000011001010001 |
3 | 201010202100201012002110 |
4 | 2322130322220121101 |
5 | 11240002441023441 |
6 | 231545432335533 |
7 | 20315112236544 |
oct | 2723472503121 |
9 | 633670635073 |
10 | 200201111121 |
11 | 779a5342a40 |
12 | 32972b445a9 |
13 | 15b56ba513b |
14 | 9992ab285b |
15 | 531ae4cb16 |
hex | 2e9cea8651 |
200201111121 has 16 divisors (see below), whose sum is σ = 291210736320. Its totient is φ = 121330206720.
The previous prime is 200201111113. The next prime is 200201111161. The reversal of 200201111121 is 121111102002.
200201111121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 200201111121 - 23 = 200201111113 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 200201111097 and 200201111106.
It is not an unprimeable number, because it can be changed into a prime (200201111161) 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, 1265401 + ... + 1414793.
It is an arithmetic number, because the mean of its divisors is an integer number (18200671020).
Almost surely, 2200201111121 is an apocalyptic number.
It is an amenable number.
200201111121 is a deficient number, since it is larger than the sum of its proper divisors (91009625199).
200201111121 is a wasteful number, since it uses less digits than its factorization.
200201111121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190016.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 200201111121 its reverse (121111102002), we get a palindrome (321312213123).
The spelling of 200201111121 in words is "two hundred billion, two hundred one million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •