Base | Representation |
---|---|
bin | 10001110001001111110… |
… | …101000011100000001111 |
3 | 11022201220020221020120011 |
4 | 101301033311003200033 |
5 | 130001313131120421 |
6 | 2332545321334051 |
7 | 154136146625122 |
oct | 21611765034017 |
9 | 4281806836504 |
10 | 1221110020111 |
11 | 430962854703 |
12 | 1787ab337327 |
13 | 8b1c4c41077 |
14 | 4315ddda3b9 |
15 | 21b6d11b4e1 |
hex | 11c4fd4380f |
1221110020111 has 16 divisors (see below), whose sum is σ = 1329968814048. Its totient is φ = 1116819532800.
The previous prime is 1221110020099. The next prime is 1221110020133. The reversal of 1221110020111 is 1110200111221.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1221110020111 - 221 = 1221107922959 is a prime.
It is a super-2 number, since 2×12211100201112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1221110020091 and 1221110020100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221110020211) 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, 7007550 + ... + 7179691.
It is an arithmetic number, because the mean of its divisors is an integer number (83123050878).
Almost surely, 21221110020111 is an apocalyptic number.
1221110020111 is a deficient number, since it is larger than the sum of its proper divisors (108858793937).
1221110020111 is a wasteful number, since it uses less digits than its factorization.
1221110020111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14187402.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1221110020111 its reverse (1110200111221), we get a palindrome (2331310131332).
The spelling of 1221110020111 in words is "one trillion, two hundred twenty-one billion, one hundred ten million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •