Base | Representation |
---|---|
bin | 1011101101100010110… |
… | …1111000111100110101 |
3 | 201020100021120202012202 |
4 | 2323120231320330311 |
5 | 11244031311412041 |
6 | 232233152354245 |
7 | 20352014133665 |
oct | 2733055707465 |
9 | 636307522182 |
10 | 201204404021 |
11 | 7836a705825 |
12 | 32bb2b45985 |
13 | 15c869c608a |
14 | 9a4a03a1a5 |
15 | 537907ea9b |
hex | 2ed8b78f35 |
201204404021 has 2 divisors, whose sum is σ = 201204404022. Its totient is φ = 201204404020.
The previous prime is 201204403999. The next prime is 201204404029. The reversal of 201204404021 is 120404402102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 200941510225 + 262893796 = 448265^2 + 16214^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201204404021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201204403984 and 201204404002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201204404029) 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, 100602202010 + 100602202011.
It is an arithmetic number, because the mean of its divisors is an integer number (100602202011).
Almost surely, 2201204404021 is an apocalyptic number.
It is an amenable number.
201204404021 is a deficient number, since it is larger than the sum of its proper divisors (1).
201204404021 is an equidigital number, since it uses as much as digits as its factorization.
201204404021 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 201204404021 its reverse (120404402102), we get a palindrome (321608806123).
The spelling of 201204404021 in words is "two hundred one billion, two hundred four million, four hundred four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •