Base | Representation |
---|---|
bin | 1000001101110111… |
… | …0010011110100011 |
3 | 12200201021022122012 |
4 | 2003131302132203 |
5 | 14004114433402 |
6 | 1002510103135 |
7 | 105441332222 |
oct | 20335623643 |
9 | 5621238565 |
10 | 2205624227 |
11 | a32021144 |
12 | 5167aaaab |
13 | 291c505c1 |
14 | 16cd02cb9 |
15 | cd97d452 |
hex | 837727a3 |
2205624227 has 4 divisors (see below), whose sum is σ = 2205749856. Its totient is φ = 2205498600.
The previous prime is 2205624221. The next prime is 2205624259. The reversal of 2205624227 is 7224265022.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2205624227 - 230 = 1131882403 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2205624193 and 2205624202.
It is not an unprimeable number, because it can be changed into a prime (2205624221) 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 in 3 ways as a sum of consecutive naturals, for example, 31163 + ... + 73364.
It is an arithmetic number, because the mean of its divisors is an integer number (551437464).
Almost surely, 22205624227 is an apocalyptic number.
2205624227 is a deficient number, since it is larger than the sum of its proper divisors (125629).
2205624227 is a wasteful number, since it uses less digits than its factorization.
2205624227 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125628.
The product of its (nonzero) digits is 26880, while the sum is 32.
The square root of 2205624227 is about 46964.0737905050. The cubic root of 2205624227 is about 1301.6988100337.
Adding to 2205624227 its reverse (7224265022), we get a palindrome (9429889249).
The spelling of 2205624227 in words is "two billion, two hundred five million, six hundred twenty-four thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •