Base | Representation |
---|---|
bin | 1000010110010101… |
… | …1111001111010001 |
3 | 12210012012121022122 |
4 | 2011211133033101 |
5 | 14042221301014 |
6 | 1010220344025 |
7 | 106352601032 |
oct | 20545371721 |
9 | 5705177278 |
10 | 2241197009 |
11 | a50108537 |
12 | 5266a5015 |
13 | 299426c9c |
14 | 173922a89 |
15 | d1b5858e |
hex | 8595f3d1 |
2241197009 has 2 divisors, whose sum is σ = 2241197010. Its totient is φ = 2241197008.
The previous prime is 2241196999. The next prime is 2241197011. The reversal of 2241197009 is 9007911422.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2214643600 + 26553409 = 47060^2 + 5153^2 .
It is a cyclic number.
It is not a de Polignac number, because 2241197009 - 28 = 2241196753 is a prime.
Together with 2241197011, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2241197009.
It is not a weakly prime, because it can be changed into another prime (2241197039) 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, 1120598504 + 1120598505.
It is an arithmetic number, because the mean of its divisors is an integer number (1120598505).
Almost surely, 22241197009 is an apocalyptic number.
It is an amenable number.
2241197009 is a deficient number, since it is larger than the sum of its proper divisors (1).
2241197009 is an equidigital number, since it uses as much as digits as its factorization.
2241197009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 35.
The square root of 2241197009 is about 47341.2822914631. The cubic root of 2241197009 is about 1308.6595477997.
The spelling of 2241197009 in words is "two billion, two hundred forty-one million, one hundred ninety-seven thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •