Base | Representation |
---|---|
bin | 1001100011110011001111… |
… | …10101110101000111111111 |
3 | 2202102121200101101100110001 |
4 | 10301321213311311013333 |
5 | 10223403121400023403 |
6 | 112413020225055131 |
7 | 4266511465516423 |
oct | 461714765650777 |
9 | 82377611340401 |
10 | 21021312111103 |
11 | 67750a7731497 |
12 | 24360a2a874a7 |
13 | b963bba428b5 |
14 | 529618d40b83 |
15 | 266c2c64bc1d |
hex | 131e67d751ff |
21021312111103 has 4 divisors (see below), whose sum is σ = 21021325009528. Its totient is φ = 21021299212680.
The previous prime is 21021312111071. The next prime is 21021312111143. The reversal of 21021312111103 is 30111121312012.
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 21021312111103 - 25 = 21021312111071 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 (21021312111143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3578688 + ... + 7406053.
It is an arithmetic number, because the mean of its divisors is an integer number (5255331252382).
Almost surely, 221021312111103 is an apocalyptic number.
21021312111103 is a deficient number, since it is larger than the sum of its proper divisors (12898425).
21021312111103 is a wasteful number, since it uses less digits than its factorization.
21021312111103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12898424.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 21021312111103 its reverse (30111121312012), we get a palindrome (51132433423115).
The spelling of 21021312111103 in words is "twenty-one trillion, twenty-one billion, three hundred twelve million, one hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •