Base | Representation |
---|---|
bin | 1001100011110001001101… |
… | …10100010111110111110111 |
3 | 2202102111212100122211121022 |
4 | 10301320212310113313313 |
5 | 10223343403112210403 |
6 | 112412320055211355 |
7 | 4266442451151143 |
oct | 461704664276767 |
9 | 82374770584538 |
10 | 21020221210103 |
11 | 6774697971415 |
12 | 2435a39676b5b |
13 | b96276a2964b |
14 | 5295540d0223 |
15 | 266bb69b1d38 |
hex | 131e26d17df7 |
21020221210103 has 4 divisors (see below), whose sum is σ = 21020356919160. Its totient is φ = 21020085501048.
The previous prime is 21020221210091. The next prime is 21020221210117. The reversal of 21020221210103 is 30101212202012.
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 21020221210103 - 26 = 21020221210039 is a prime.
It is a super-3 number, since 3×210202212101033 (a number of 41 digits) contains 333 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 (21020221210903) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 67621925 + ... + 67932062.
It is an arithmetic number, because the mean of its divisors is an integer number (5255089229790).
Almost surely, 221020221210103 is an apocalyptic number.
21020221210103 is a deficient number, since it is larger than the sum of its proper divisors (135709057).
21020221210103 is a wasteful number, since it uses less digits than its factorization.
21020221210103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135709056.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 21020221210103 its reverse (30101212202012), we get a palindrome (51121433412115).
The spelling of 21020221210103 in words is "twenty-one trillion, twenty billion, two hundred twenty-one million, two hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •