Base | Representation |
---|---|
bin | 10011100110101100… |
… | …001001010000011001 |
3 | 2000100000200000100021 |
4 | 103212230021100121 |
5 | 321102322413423 |
6 | 13400442510441 |
7 | 1343433520504 |
oct | 234654112031 |
9 | 60300600307 |
10 | 21050201113 |
11 | 8a22320727 |
12 | 40b5805421 |
13 | 1ca6140906 |
14 | 103998013b |
15 | 83306695d |
hex | 4e6b09419 |
21050201113 has 2 divisors, whose sum is σ = 21050201114. Its totient is φ = 21050201112.
The previous prime is 21050201101. The next prime is 21050201119. The reversal of 21050201113 is 31110205012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20542915584 + 507285529 = 143328^2 + 22523^2 .
It is a cyclic number.
It is not a de Polignac number, because 21050201113 - 29 = 21050200601 is a prime.
It is a super-2 number, since 2×210502011132 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21050201119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10525100556 + 10525100557.
It is an arithmetic number, because the mean of its divisors is an integer number (10525100557).
Almost surely, 221050201113 is an apocalyptic number.
It is an amenable number.
21050201113 is a deficient number, since it is larger than the sum of its proper divisors (1).
21050201113 is an equidigital number, since it uses as much as digits as its factorization.
21050201113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 16.
Adding to 21050201113 its reverse (31110205012), we get a palindrome (52160406125).
The spelling of 21050201113 in words is "twenty-one billion, fifty million, two hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •