Base | Representation |
---|---|
bin | 1001001100000001010000… |
… | …01011010000111110011101 |
3 | 2122112111120110011120022102 |
4 | 10212000220023100332131 |
5 | 10122011200222432031 |
6 | 110545403105054445 |
7 | 4153463626061114 |
oct | 446005013207635 |
9 | 78474513146272 |
10 | 20204200202141 |
11 | 648a60a32327a |
12 | 2323861927425 |
13 | b3732b84c907 |
14 | 4dbc620c8c7b |
15 | 250856e297cb |
hex | 1260282d0f9d |
20204200202141 has 2 divisors, whose sum is σ = 20204200202142. Its totient is φ = 20204200202140.
The previous prime is 20204200202129. The next prime is 20204200202167. The reversal of 20204200202141 is 14120200240202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19594309490116 + 609890712025 = 4426546^2 + 780955^2 .
It is a cyclic number.
It is not a de Polignac number, because 20204200202141 - 210 = 20204200201117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20204200282141) 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 as a sum of consecutive naturals, namely, 10102100101070 + 10102100101071.
It is an arithmetic number, because the mean of its divisors is an integer number (10102100101071).
Almost surely, 220204200202141 is an apocalyptic number.
It is an amenable number.
20204200202141 is a deficient number, since it is larger than the sum of its proper divisors (1).
20204200202141 is an equidigital number, since it uses as much as digits as its factorization.
20204200202141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 512, while the sum is 20.
Adding to 20204200202141 its reverse (14120200240202), we get a palindrome (34324400442343).
The spelling of 20204200202141 in words is "twenty trillion, two hundred four billion, two hundred million, two hundred two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •