Base | Representation |
---|---|
bin | 1000001101010010… |
… | …0010101011001001 |
3 | 12200112201011111110 |
4 | 2003110202223021 |
5 | 14003004401301 |
6 | 1002342120533 |
7 | 105411615126 |
oct | 20324425311 |
9 | 5615634443 |
10 | 2203200201 |
11 | a30715a14 |
12 | 515a20149 |
13 | 2915b2177 |
14 | 16c87174d |
15 | cd6500d6 |
hex | 83522ac9 |
2203200201 has 8 divisors (see below), whose sum is σ = 2939283040. Its totient is φ = 1467958752.
The previous prime is 2203200173. The next prime is 2203200217. The reversal of 2203200201 is 1020023022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2203200201 - 210 = 2203199177 is a prime.
It is a super-2 number, since 2×22032002012 = 9708182251372880802, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2203200281) 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 7 ways as a sum of consecutive naturals, for example, 204211 + ... + 214728.
It is an arithmetic number, because the mean of its divisors is an integer number (367410380).
Almost surely, 22203200201 is an apocalyptic number.
It is an amenable number.
2203200201 is a deficient number, since it is larger than the sum of its proper divisors (736082839).
2203200201 is a wasteful number, since it uses less digits than its factorization.
2203200201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 420695.
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 2203200201 is about 46938.2594585696. The cubic root of 2203200201 is about 1301.2217707207.
Adding to 2203200201 its reverse (1020023022), we get a palindrome (3223223223).
The spelling of 2203200201 in words is "two billion, two hundred three million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •