Base | Representation |
---|---|
bin | 1000001100101010… |
… | …1101101010110101 |
3 | 12200100212021100002 |
4 | 2003022231222311 |
5 | 14001324430142 |
6 | 1002211001045 |
7 | 105350664551 |
oct | 20312555265 |
9 | 5610767302 |
10 | 2200623797 |
11 | a2a216259 |
12 | 514b99185 |
13 | 290bbc578 |
14 | 16c3a0861 |
15 | cd2e1a32 |
hex | 832adab5 |
2200623797 has 2 divisors, whose sum is σ = 2200623798. Its totient is φ = 2200623796.
The previous prime is 2200623767. The next prime is 2200623839. The reversal of 2200623797 is 7973260022.
It is a happy number.
2200623797 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2116828081 + 83795716 = 46009^2 + 9154^2 .
It is a cyclic number.
It is not a de Polignac number, because 2200623797 - 214 = 2200607413 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2200623797.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2200623767) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100311898 + 1100311899.
It is an arithmetic number, because the mean of its divisors is an integer number (1100311899).
Almost surely, 22200623797 is an apocalyptic number.
It is an amenable number.
2200623797 is a deficient number, since it is larger than the sum of its proper divisors (1).
2200623797 is an equidigital number, since it uses as much as digits as its factorization.
2200623797 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 63504, while the sum is 38.
The square root of 2200623797 is about 46910.8068252935. The cubic root of 2200623797 is about 1300.7143602415.
The spelling of 2200623797 in words is "two billion, two hundred million, six hundred twenty-three thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •