Base | Representation |
---|---|
bin | 1001100110101101001001… |
… | …11110011000110010001111 |
3 | 2202210011022022022200011110 |
4 | 10303112210332120302033 |
5 | 10232022024213343203 |
6 | 112530524241423103 |
7 | 4306644043626135 |
oct | 463264476306217 |
9 | 82704268280143 |
10 | 21121122012303 |
11 | 6803465827545 |
12 | 24514b903aa93 |
13 | ba2937053931 |
14 | 5303a6a39755 |
15 | 26961ed35d03 |
hex | 1335a4f98c8f |
21121122012303 has 16 divisors (see below), whose sum is σ = 28178921949696. Its totient is φ = 14072037680160.
The previous prime is 21121122012299. The next prime is 21121122012433. The reversal of 21121122012303 is 30321022112112.
It is not a de Polignac number, because 21121122012303 - 22 = 21121122012299 is a prime.
It is a super-2 number, since 2×211211220123032 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21121122012303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21121122012803) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 32018401 + ... + 32671397.
It is an arithmetic number, because the mean of its divisors is an integer number (1761182621856).
Almost surely, 221121122012303 is an apocalyptic number.
21121122012303 is a deficient number, since it is larger than the sum of its proper divisors (7057799937393).
21121122012303 is a wasteful number, since it uses less digits than its factorization.
21121122012303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 659654.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 21121122012303 its reverse (30321022112112), we get a palindrome (51442144124415).
The spelling of 21121122012303 in words is "twenty-one trillion, one hundred twenty-one billion, one hundred twenty-two million, twelve thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •