Base | Representation |
---|---|
bin | 10001110000100000111… |
… | …011001111010010110111 |
3 | 11022122212102020011201201 |
4 | 101300200323033102313 |
5 | 124443210204041434 |
6 | 2332335251233331 |
7 | 154110513206536 |
oct | 21604073172267 |
9 | 4278772204651 |
10 | 1220323112119 |
11 | 430599646021 |
12 | 17860b8a8847 |
13 | 8b0cabc3237 |
14 | 430c76bc31d |
15 | 21b23ecd614 |
hex | 11c20ecf4b7 |
1220323112119 has 2 divisors, whose sum is σ = 1220323112120. Its totient is φ = 1220323112118.
The previous prime is 1220323112117. The next prime is 1220323112147. The reversal of 1220323112119 is 9112113230221.
It is an a-pointer prime, because the next prime (1220323112147) can be obtained adding 1220323112119 to its sum of digits (28).
It is a weak prime.
It is an emirp because it is prime and its reverse (9112113230221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1220323112119 - 21 = 1220323112117 is a prime.
It is a super-2 number, since 2×12203231121192 (a number of 25 digits) contains 22 as substring.
Together with 1220323112117, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1220323112117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610161556059 + 610161556060.
It is an arithmetic number, because the mean of its divisors is an integer number (610161556060).
Almost surely, 21220323112119 is an apocalyptic number.
1220323112119 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220323112119 is an equidigital number, since it uses as much as digits as its factorization.
1220323112119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 28.
The spelling of 1220323112119 in words is "one trillion, two hundred twenty billion, three hundred twenty-three million, one hundred twelve thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •