Base | Representation |
---|---|
bin | 100000000000111010110… |
… | …000101101011011011101 |
3 | 21210022121102021000112012 |
4 | 200000322300231123131 |
5 | 242021104312244234 |
6 | 4402400434121005 |
7 | 314642163554441 |
oct | 40007260553335 |
9 | 7708542230465 |
10 | 2200009103069 |
11 | 77902286a288 |
12 | 2b6462720165 |
13 | 12c5c971ca7b |
14 | 786a3c60821 |
15 | 3c36214e0ce |
hex | 2003ac2d6dd |
2200009103069 has 2 divisors, whose sum is σ = 2200009103070. Its totient is φ = 2200009103068.
The previous prime is 2200009102981. The next prime is 2200009103081. The reversal of 2200009103069 is 9603019000022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2192952263044 + 7056840025 = 1480862^2 + 84005^2 .
It is a cyclic number.
It is not a de Polignac number, because 2200009103069 - 232 = 2195714135773 is a prime.
It is a super-2 number, since 2×22000091030692 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2200009103099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100004551534 + 1100004551535.
It is an arithmetic number, because the mean of its divisors is an integer number (1100004551535).
Almost surely, 22200009103069 is an apocalyptic number.
It is an amenable number.
2200009103069 is a deficient number, since it is larger than the sum of its proper divisors (1).
2200009103069 is an equidigital number, since it uses as much as digits as its factorization.
2200009103069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 32.
The spelling of 2200009103069 in words is "two trillion, two hundred billion, nine million, one hundred three thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •