Base | Representation |
---|---|
bin | 100000000001001101010… |
… | …100111010000011101101 |
3 | 21210100102010100210010001 |
4 | 200001031110322003231 |
5 | 242022224032104434 |
6 | 4402451402144301 |
7 | 314652665233054 |
oct | 40011524720355 |
9 | 7710363323101 |
10 | 2200320581869 |
11 | 779172673983 |
12 | 2b652aab2091 |
13 | 12c649109557 |
14 | 786d338139b |
15 | 3c37e679114 |
hex | 2004d53a0ed |
2200320581869 has 2 divisors, whose sum is σ = 2200320581870. Its totient is φ = 2200320581868.
The previous prime is 2200320581861. The next prime is 2200320581971. The reversal of 2200320581869 is 9681850230022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2148021465769 + 52299116100 = 1465613^2 + 228690^2 .
It is a cyclic number.
It is not a de Polignac number, because 2200320581869 - 23 = 2200320581861 is a prime.
It is a super-2 number, since 2×22003205818692 (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 (2200320581861) 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, 1100160290934 + 1100160290935.
It is an arithmetic number, because the mean of its divisors is an integer number (1100160290935).
Almost surely, 22200320581869 is an apocalyptic number.
It is an amenable number.
2200320581869 is a deficient number, since it is larger than the sum of its proper divisors (1).
2200320581869 is an equidigital number, since it uses as much as digits as its factorization.
2200320581869 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 414720, while the sum is 46.
The spelling of 2200320581869 in words is "two trillion, two hundred billion, three hundred twenty million, five hundred eighty-one thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •