Base | Representation |
---|---|
bin | 10001110000001101101… |
… | …010101111101001110111 |
3 | 11022122000220021110012002 |
4 | 101300031222233221313 |
5 | 124442030001133421 |
6 | 2332243230245515 |
7 | 154066511035334 |
oct | 21601552575167 |
9 | 4278026243162 |
10 | 1220000021111 |
11 | 43044322aa63 |
12 | 17853b65689b |
13 | 8b078c9c121 |
14 | 4309681798b |
15 | 21b0595cb0b |
hex | 11c0daafa77 |
1220000021111 has 4 divisors (see below), whose sum is σ = 1220003846712. Its totient is φ = 1219996195512.
The previous prime is 1220000021087. The next prime is 1220000021137. The reversal of 1220000021111 is 1111200000221.
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 1220000021111 - 230 = 1218926279287 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1220000021092 and 1220000021101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220000021011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1386101 + ... + 2088366.
It is an arithmetic number, because the mean of its divisors is an integer number (305000961678).
Almost surely, 21220000021111 is an apocalyptic number.
1220000021111 is a deficient number, since it is larger than the sum of its proper divisors (3825601).
1220000021111 is an equidigital number, since it uses as much as digits as its factorization.
1220000021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3825600.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1220000021111 its reverse (1111200000221), we get a palindrome (2331200021332).
The spelling of 1220000021111 in words is "one trillion, two hundred twenty billion, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •