Base | Representation |
---|---|
bin | 1001101001000100000000… |
… | …10111100000101111000111 |
3 | 2210001220100122200111220101 |
4 | 10310202000113200233013 |
5 | 10234333411212020403 |
6 | 113032041010544531 |
7 | 4315542051216013 |
oct | 464420027405707 |
9 | 83056318614811 |
10 | 21202112220103 |
11 | 6834846679381 |
12 | 2465140598147 |
13 | baa473377809 |
14 | 53428b0d3543 |
15 | 26b7b01ee71d |
hex | 1348805e0bc7 |
21202112220103 has 4 divisors (see below), whose sum is σ = 21329070976080. Its totient is φ = 21075153464128.
The previous prime is 21202112220067. The next prime is 21202112220131. The reversal of 21202112220103 is 30102221120212.
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 21202112220103 - 237 = 21064673266631 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 (21202112220143) 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, 63479377738 + ... + 63479378071.
It is an arithmetic number, because the mean of its divisors is an integer number (5332267744020).
Almost surely, 221202112220103 is an apocalyptic number.
21202112220103 is a deficient number, since it is larger than the sum of its proper divisors (126958755977).
21202112220103 is a wasteful number, since it uses less digits than its factorization.
21202112220103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126958755976.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 21202112220103 its reverse (30102221120212), we get a palindrome (51304333340315).
The spelling of 21202112220103 in words is "twenty-one trillion, two hundred two billion, one hundred twelve million, two hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •