Base | Representation |
---|---|
bin | 1000001101111000… |
… | …1010011001110111 |
3 | 12200201110022001222 |
4 | 2003132022121313 |
5 | 14004131102411 |
6 | 1002512140555 |
7 | 105442221026 |
oct | 20336123167 |
9 | 5621408058 |
10 | 2205722231 |
11 | a32088839 |
12 | 51683775b |
13 | 291c860ab |
14 | 16cd2a8bd |
15 | cd99c4db |
hex | 8378a677 |
2205722231 has 2 divisors, whose sum is σ = 2205722232. Its totient is φ = 2205722230.
The previous prime is 2205722203. The next prime is 2205722249. The reversal of 2205722231 is 1322275022.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2205722231 is a prime.
It is a super-2 number, since 2×22057222312 = 9730421120655234722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2205722231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2205722201) 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, 1102861115 + 1102861116.
It is an arithmetic number, because the mean of its divisors is an integer number (1102861116).
Almost surely, 22205722231 is an apocalyptic number.
2205722231 is a deficient number, since it is larger than the sum of its proper divisors (1).
2205722231 is an equidigital number, since it uses as much as digits as its factorization.
2205722231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3360, while the sum is 26.
The square root of 2205722231 is about 46965.1171722162. The cubic root of 2205722231 is about 1301.7180895040.
Adding to 2205722231 its reverse (1322275022), we get a palindrome (3527997253).
The spelling of 2205722231 in words is "two billion, two hundred five million, seven hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •