Base | Representation |
---|---|
bin | 100000000001010001010… |
… | …001101101110001011101 |
3 | 21210100120202001202100201 |
4 | 200001101101231301131 |
5 | 242022343013311411 |
6 | 4402502130423501 |
7 | 314654431442161 |
oct | 40012121556135 |
9 | 7710522052321 |
10 | 2200386853981 |
11 | 7791a7019118 |
12 | 2b6549131b91 |
13 | 12c659a71314 |
14 | 786dc0b2ca1 |
15 | 3c3853ba3c1 |
hex | 2005146dc5d |
2200386853981 has 2 divisors, whose sum is σ = 2200386853982. Its totient is φ = 2200386853980.
The previous prime is 2200386853871. The next prime is 2200386854027. The reversal of 2200386853981 is 1893586830022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2030753252025 + 169633601956 = 1425045^2 + 411866^2 .
It is a cyclic number.
It is not a de Polignac number, because 2200386853981 - 211 = 2200386851933 is a prime.
It is a super-2 number, since 2×22003868539812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2200386853781) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100193426990 + 1100193426991.
It is an arithmetic number, because the mean of its divisors is an integer number (1100193426991).
Almost surely, 22200386853981 is an apocalyptic number.
It is an amenable number.
2200386853981 is a deficient number, since it is larger than the sum of its proper divisors (1).
2200386853981 is an equidigital number, since it uses as much as digits as its factorization.
2200386853981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4976640, while the sum is 55.
The spelling of 2200386853981 in words is "two trillion, two hundred billion, three hundred eighty-six million, eight hundred fifty-three thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •