Base | Representation |
---|---|
bin | 1011111010101110000… |
… | …1110001111011101001 |
3 | 201120110202201201112201 |
4 | 2332223201301323221 |
5 | 11323302223101441 |
6 | 234020134540201 |
7 | 20535451450012 |
oct | 2765341617351 |
9 | 646422651481 |
10 | 204741222121 |
11 | 7991509a597 |
12 | 3381b507661 |
13 | 163cb683b57 |
14 | 9ca3a60009 |
15 | 54d4810c31 |
hex | 2fab871ee9 |
204741222121 has 2 divisors, whose sum is σ = 204741222122. Its totient is φ = 204741222120.
The previous prime is 204741222001. The next prime is 204741222157. The reversal of 204741222121 is 121222147402.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 122965240896 + 81775981225 = 350664^2 + 285965^2 .
It is a cyclic number.
It is not a de Polignac number, because 204741222121 - 221 = 204739124969 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 204741222121.
It is not a weakly prime, because it can be changed into another prime (204741022121) 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, 102370611060 + 102370611061.
It is an arithmetic number, because the mean of its divisors is an integer number (102370611061).
Almost surely, 2204741222121 is an apocalyptic number.
It is an amenable number.
204741222121 is a deficient number, since it is larger than the sum of its proper divisors (1).
204741222121 is an equidigital number, since it uses as much as digits as its factorization.
204741222121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3584, while the sum is 28.
Adding to 204741222121 its reverse (121222147402), we get a palindrome (325963369523).
The spelling of 204741222121 in words is "two hundred four billion, seven hundred forty-one million, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •