Base | Representation |
---|---|
bin | 10001110001001111110… |
… | …100111110110101110011 |
3 | 11022201220020220021100202 |
4 | 101301033310332311303 |
5 | 130001313130013021 |
6 | 2332545321105415 |
7 | 154136146515335 |
oct | 21611764766563 |
9 | 4281806807322 |
10 | 1221110001011 |
11 | 43096284131a |
12 | 1787ab32826b |
13 | 8b1c4c35474 |
14 | 4315ddd3455 |
15 | 21b6d115a0b |
hex | 11c4fd3ed73 |
1221110001011 has 4 divisors (see below), whose sum is σ = 1222169074152. Its totient is φ = 1220050927872.
The previous prime is 1221110000951. The next prime is 1221110001019. The reversal of 1221110001011 is 1101000111221.
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 1221110001011 - 210 = 1221109999987 is a prime.
It is a super-2 number, since 2×12211100010112 (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 = 1221110000983 and 1221110001001.
It is not an unprimeable number, because it can be changed into a prime (1221110001019) 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, 529534841 + ... + 529537146.
It is an arithmetic number, because the mean of its divisors is an integer number (305542268538).
Almost surely, 21221110001011 is an apocalyptic number.
1221110001011 is a deficient number, since it is larger than the sum of its proper divisors (1059073141).
1221110001011 is a wasteful number, since it uses less digits than its factorization.
1221110001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1059073140.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1221110001011 its reverse (1101000111221), we get a palindrome (2322110112232).
The spelling of 1221110001011 in words is "one trillion, two hundred twenty-one billion, one hundred ten million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •