Base | Representation |
---|---|
bin | 10100101011011010… |
… | …111100011110001001 |
3 | 2010022101110112100122 |
4 | 110223122330132021 |
5 | 330433022221301 |
6 | 14111114113025 |
7 | 1414135051646 |
oct | 245332743611 |
9 | 63271415318 |
10 | 22203320201 |
11 | 9464217107 |
12 | 4377a1b775 |
13 | 212accc5ba |
14 | 1108b88dcd |
15 | 89e3e181b |
hex | 52b6bc789 |
22203320201 has 2 divisors, whose sum is σ = 22203320202. Its totient is φ = 22203320200.
The previous prime is 22203320179. The next prime is 22203320207. The reversal of 22203320201 is 10202330222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20782105600 + 1421214601 = 144160^2 + 37699^2 .
It is a cyclic number.
It is not a de Polignac number, because 22203320201 - 226 = 22136211337 is a prime.
It is a Sophie Germain 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 22203320201.
It is not a weakly prime, because it can be changed into another prime (22203320207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11101660100 + 11101660101.
It is an arithmetic number, because the mean of its divisors is an integer number (11101660101).
Almost surely, 222203320201 is an apocalyptic number.
It is an amenable number.
22203320201 is a deficient number, since it is larger than the sum of its proper divisors (1).
22203320201 is an equidigital number, since it uses as much as digits as its factorization.
22203320201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 22203320201 its reverse (10202330222), we get a palindrome (32405650423).
The spelling of 22203320201 in words is "twenty-two billion, two hundred three million, three hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •