Base | Representation |
---|---|
bin | 1001101001000110000010… |
… | …01101001001011001011111 |
3 | 2210002000011110120120201122 |
4 | 10310203001031021121133 |
5 | 10234343123201201421 |
6 | 113032340550201155 |
7 | 4315611030326312 |
oct | 464430115113137 |
9 | 83060143516648 |
10 | 21203200022111 |
11 | 68352547120a8 |
12 | 24653a49531bb |
13 | baa5b7847343 |
14 | 534351778979 |
15 | 26b8259762ab |
hex | 1348c134965f |
21203200022111 has 4 divisors (see below), whose sum is σ = 21203287398432. Its totient is φ = 21203112645792.
The previous prime is 21203200022107. The next prime is 21203200022167. The reversal of 21203200022111 is 11122000230212.
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 21203200022111 - 22 = 21203200022107 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21203200022111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21203200022171) 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, 43323146 + ... + 43809831.
It is an arithmetic number, because the mean of its divisors is an integer number (5300821849608).
Almost surely, 221203200022111 is an apocalyptic number.
21203200022111 is a deficient number, since it is larger than the sum of its proper divisors (87376321).
21203200022111 is an equidigital number, since it uses as much as digits as its factorization.
21203200022111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87376320.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 21203200022111 its reverse (11122000230212), we get a palindrome (32325200252323).
The spelling of 21203200022111 in words is "twenty-one trillion, two hundred three billion, two hundred million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •