Base | Representation |
---|---|
bin | 1001001001000010111001… |
… | …00100111110001100101101 |
3 | 2122011201202221201112200111 |
4 | 10210201130210332030231 |
5 | 10113322344014003401 |
6 | 110430421551100021 |
7 | 4143215205640354 |
oct | 444413444761455 |
9 | 78151687645614 |
10 | 20102000141101 |
11 | 645023502680a |
12 | 2307a9b211611 |
13 | b2a7c22b9b08 |
14 | 4d6d28bb299b |
15 | 24cd749aee51 |
hex | 12485c93e32d |
20102000141101 has 2 divisors, whose sum is σ = 20102000141102. Its totient is φ = 20102000141100.
The previous prime is 20102000141077. The next prime is 20102000141123. The reversal of 20102000141101 is 10114100020102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10089199322500 + 10012800818601 = 3176350^2 + 3164301^2 .
It is a cyclic number.
It is not a de Polignac number, because 20102000141101 - 233 = 20093410206509 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20102000141801) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10051000070550 + 10051000070551.
It is an arithmetic number, because the mean of its divisors is an integer number (10051000070551).
Almost surely, 220102000141101 is an apocalyptic number.
It is an amenable number.
20102000141101 is a deficient number, since it is larger than the sum of its proper divisors (1).
20102000141101 is an equidigital number, since it uses as much as digits as its factorization.
20102000141101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20102000141101 its reverse (10114100020102), we get a palindrome (30216100161203).
The spelling of 20102000141101 in words is "twenty trillion, one hundred two billion, one hundred forty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •