Base | Representation |
---|---|
bin | 1011000111010011110111… |
… | …1000001111110001110101 |
3 | 1121021020112011001220102111 |
4 | 2301310331320033301311 |
5 | 3100204002322040424 |
6 | 41553520331211021 |
7 | 2400611306044231 |
oct | 261647570176165 |
9 | 47236464056374 |
10 | 12220220111989 |
11 | 399162574445a |
12 | 145443aba6a71 |
13 | 6a8491b93066 |
14 | 3036672c15c1 |
15 | 162d215de194 |
hex | b1d3de0fc75 |
12220220111989 has 2 divisors, whose sum is σ = 12220220111990. Its totient is φ = 12220220111988.
The previous prime is 12220220111947. The next prime is 12220220112019. The reversal of 12220220111989 is 98911102202221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11433392568900 + 786827543089 = 3381330^2 + 887033^2 .
It is an emirp because it is prime and its reverse (98911102202221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12220220111989 - 211 = 12220220109941 is a prime.
It is a super-2 number, since 2×122202201119892 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12220220111929) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110110055994 + 6110110055995.
It is an arithmetic number, because the mean of its divisors is an integer number (6110110055995).
Almost surely, 212220220111989 is an apocalyptic number.
It is an amenable number.
12220220111989 is a deficient number, since it is larger than the sum of its proper divisors (1).
12220220111989 is an equidigital number, since it uses as much as digits as its factorization.
12220220111989 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20736, while the sum is 40.
The spelling of 12220220111989 in words is "twelve trillion, two hundred twenty billion, two hundred twenty million, one hundred eleven thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •