Base | Representation |
---|---|
bin | 1001100110011110000111… |
… | …00000000001100110000111 |
3 | 2202202101110100111220110021 |
4 | 10303033003200001212013 |
5 | 10231404003304241403 |
6 | 112523110522240011 |
7 | 4306236626514214 |
oct | 463170340014607 |
9 | 82671410456407 |
10 | 21113044212103 |
11 | 67aaaa0050708 |
12 | 244ba23956007 |
13 | ba1c4a6707bc |
14 | 52dc3bcbcb0b |
15 | 2692eaabd8bd |
hex | 1333c3801987 |
21113044212103 has 4 divisors (see below), whose sum is σ = 21142085539120. Its totient is φ = 21084002885088.
The previous prime is 21113044212067. The next prime is 21113044212131. The reversal of 21113044212103 is 30121244031112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21113044212103 - 225 = 21113010657671 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21113044212133) 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 in 3 ways as a sum of consecutive naturals, for example, 14520662418 + ... + 14520663871.
It is an arithmetic number, because the mean of its divisors is an integer number (5285521384780).
Almost surely, 221113044212103 is an apocalyptic number.
21113044212103 is a deficient number, since it is larger than the sum of its proper divisors (29041327017).
21113044212103 is an equidigital number, since it uses as much as digits as its factorization.
21113044212103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29041327016.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 21113044212103 its reverse (30121244031112), we get a palindrome (51234288243215).
The spelling of 21113044212103 in words is "twenty-one trillion, one hundred thirteen billion, forty-four million, two hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •