Base | Representation |
---|---|
bin | 1000001100100100… |
… | …1001111011001101 |
3 | 12200100002111220112 |
4 | 2003021021323031 |
5 | 14001223341440 |
6 | 1002154125405 |
7 | 105344343464 |
oct | 20311117315 |
9 | 5610074815 |
10 | 2200215245 |
11 | a29a67308 |
12 | 514a20865 |
13 | 290aa8617 |
14 | 16c2d59db |
15 | cd260965 |
hex | 83249ecd |
2200215245 has 4 divisors (see below), whose sum is σ = 2640258300. Its totient is φ = 1760172192.
The previous prime is 2200215233. The next prime is 2200215263. The reversal of 2200215245 is 5425120022.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 951228964 + 1248986281 = 30842^2 + 35341^2 .
It is a cyclic number.
It is not a de Polignac number, because 2200215245 - 212 = 2200211149 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2200215245.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 220021520 + ... + 220021529.
It is an arithmetic number, because the mean of its divisors is an integer number (660064575).
Almost surely, 22200215245 is an apocalyptic number.
It is an amenable number.
2200215245 is a deficient number, since it is larger than the sum of its proper divisors (440043055).
2200215245 is an equidigital number, since it uses as much as digits as its factorization.
2200215245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440043054.
The product of its (nonzero) digits is 1600, while the sum is 23.
The square root of 2200215245 is about 46906.4520615235. The cubic root of 2200215245 is about 1300.6338614994.
Adding to 2200215245 its reverse (5425120022), we get a palindrome (7625335267).
The spelling of 2200215245 in words is "two billion, two hundred million, two hundred fifteen thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •