Base | Representation |
---|---|
bin | 1001101001100111011011… |
… | …11110110010011110010111 |
3 | 2210010201110010001211021102 |
4 | 10310303231332302132113 |
5 | 10240141334030231403 |
6 | 113044504131340315 |
7 | 4320114261103412 |
oct | 464635576623627 |
9 | 83121403054242 |
10 | 21221131102103 |
11 | 6841916300979 |
12 | 2468969a5169b |
13 | bac1b46c684a |
14 | 535172d84b79 |
15 | 26c024c68b88 |
hex | 134cedfb2797 |
21221131102103 has 8 divisors (see below), whose sum is σ = 21396186857472. Its totient is φ = 21046199725656.
The previous prime is 21221131102057. The next prime is 21221131102109. The reversal of 21221131102103 is 30120113112212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21221131102103 - 242 = 16823084590999 is a prime.
It is a super-2 number, since 2×212211311021032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21221131102109) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30752075 + ... + 31434572.
It is an arithmetic number, because the mean of its divisors is an integer number (2674523357184).
Almost surely, 221221131102103 is an apocalyptic number.
21221131102103 is a deficient number, since it is larger than the sum of its proper divisors (175055755369).
21221131102103 is a wasteful number, since it uses less digits than its factorization.
21221131102103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62189461.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 21221131102103 its reverse (30120113112212), we get a palindrome (51341244214315).
The spelling of 21221131102103 in words is "twenty-one trillion, two hundred twenty-one billion, one hundred thirty-one million, one hundred two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •