Base | Representation |
---|---|
bin | 1011101001011110001… |
… | …1101111010100111001 |
3 | 201010112002120110022022 |
4 | 2322113203233110321 |
5 | 11234311433132441 |
6 | 231532502004225 |
7 | 20312641224404 |
oct | 2722743572471 |
9 | 633462513268 |
10 | 200111224121 |
11 | 77959629566 |
12 | 32948a16675 |
13 | 15b41392773 |
14 | 9984b94d3b |
15 | 53130e484b |
hex | 2e978ef539 |
200111224121 has 2 divisors, whose sum is σ = 200111224122. Its totient is φ = 200111224120.
The previous prime is 200111224099. The next prime is 200111224127. The reversal of 200111224121 is 121422111002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 178983148096 + 21128076025 = 423064^2 + 145355^2 .
It is a cyclic number.
It is not a de Polignac number, because 200111224121 - 222 = 200107029817 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200111224121.
It is not a weakly prime, because it can be changed into another prime (200111224127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100055612060 + 100055612061.
It is an arithmetic number, because the mean of its divisors is an integer number (100055612061).
Almost surely, 2200111224121 is an apocalyptic number.
It is an amenable number.
200111224121 is a deficient number, since it is larger than the sum of its proper divisors (1).
200111224121 is an equidigital number, since it uses as much as digits as its factorization.
200111224121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 200111224121 its reverse (121422111002), we get a palindrome (321533335123).
The spelling of 200111224121 in words is "two hundred billion, one hundred eleven million, two hundred twenty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •