Base | Representation |
---|---|
bin | 1001001001000001001110… |
… | …00011100110110100011111 |
3 | 2122011122110101002112000001 |
4 | 10210200213003212310133 |
5 | 10113314024130432033 |
6 | 110430152513115131 |
7 | 4143154023404464 |
oct | 444404703466437 |
9 | 78148411075001 |
10 | 20101102202143 |
11 | 644a9141819a6 |
12 | 230788a558aa7 |
13 | b2a6ab2655a1 |
14 | 4d6c8183166b |
15 | 24cd20c3de7d |
hex | 1248270e6d1f |
20101102202143 has 2 divisors, whose sum is σ = 20101102202144. Its totient is φ = 20101102202142.
The previous prime is 20101102202117. The next prime is 20101102202197. The reversal of 20101102202143 is 34120220110102.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20101102202143 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20101102202143.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20101102212143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050551101071 + 10050551101072.
It is an arithmetic number, because the mean of its divisors is an integer number (10050551101072).
Almost surely, 220101102202143 is an apocalyptic number.
20101102202143 is a deficient number, since it is larger than the sum of its proper divisors (1).
20101102202143 is an equidigital number, since it uses as much as digits as its factorization.
20101102202143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 20101102202143 its reverse (34120220110102), we get a palindrome (54221322312245).
It can be divided in two parts, 2010110 and 2202143, that added together give a triangular number (4212253 = T2902).
The spelling of 20101102202143 in words is "twenty trillion, one hundred one billion, one hundred two million, two hundred two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •