Base | Representation |
---|---|
bin | 10001110000011010110… |
… | …010010010010111100111 |
3 | 11022122121020101201120112 |
4 | 101300122302102113213 |
5 | 124443002321231434 |
6 | 2332321131323235 |
7 | 154105122510044 |
oct | 21603262222747 |
9 | 4278536351515 |
10 | 1220220102119 |
11 | 430546489097 |
12 | 1785a12b051b |
13 | 8b0b2767685 |
14 | 430b7b461cb |
15 | 21b19e31dce |
hex | 11c1ac925e7 |
1220220102119 has 2 divisors, whose sum is σ = 1220220102120. Its totient is φ = 1220220102118.
The previous prime is 1220220102097. The next prime is 1220220102121. The reversal of 1220220102119 is 9112010220221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1220220102119 - 216 = 1220220036583 is a prime.
It is a super-2 number, since 2×12202201021192 (a number of 25 digits) contains 22 as substring.
Together with 1220220102121, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1220220102094 and 1220220102103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1220220102019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610110051059 + 610110051060.
It is an arithmetic number, because the mean of its divisors is an integer number (610110051060).
Almost surely, 21220220102119 is an apocalyptic number.
1220220102119 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220220102119 is an equidigital number, since it uses as much as digits as its factorization.
1220220102119 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 23.
It can be divided in two parts, 1220220102 and 119, that added together give a palindrome (1220220221).
The spelling of 1220220102119 in words is "one trillion, two hundred twenty billion, two hundred twenty million, one hundred two thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •