Base | Representation |
---|---|
bin | 1000001100110100… |
… | …0001101110000011 |
3 | 12200102000002011212 |
4 | 2003031001232003 |
5 | 14002003331321 |
6 | 1002232000335 |
7 | 105356101535 |
oct | 20315015603 |
9 | 5612002155 |
10 | 2201230211 |
11 | a2a59a924 |
12 | 5152300ab |
13 | 2910725ab |
14 | 16c4bb855 |
15 | cd3b155b |
hex | 83341b83 |
2201230211 has 4 divisors (see below), whose sum is σ = 2210842800. Its totient is φ = 2191617624.
The previous prime is 2201230153. The next prime is 2201230219. The reversal of 2201230211 is 1120321022.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1120321022 = 2 ⋅560160511.
It is a cyclic number.
It is not a de Polignac number, because 2201230211 - 210 = 2201229187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2201230219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4805951 + ... + 4806408.
It is an arithmetic number, because the mean of its divisors is an integer number (552710700).
Almost surely, 22201230211 is an apocalyptic number.
2201230211 is a deficient number, since it is larger than the sum of its proper divisors (9612589).
2201230211 is an equidigital number, since it uses as much as digits as its factorization.
2201230211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9612588.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 2201230211 is about 46917.2698587631. The cubic root of 2201230211 is about 1300.8338262095.
Adding to 2201230211 its reverse (1120321022), we get a palindrome (3321551233).
The spelling of 2201230211 in words is "two billion, two hundred one million, two hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •