Base | Representation |
---|---|
bin | 1011101101100110100… |
… | …1110011111101001001 |
3 | 201020101101010210210012 |
4 | 2323121221303331021 |
5 | 11244044322042301 |
6 | 232234513201305 |
7 | 20352264506303 |
oct | 2733151637511 |
9 | 636341123705 |
10 | 201220112201 |
11 | 78378564599 |
12 | 32bb8260235 |
13 | 15c8a035b64 |
14 | 9a4c168973 |
15 | 537a633ebb |
hex | 2ed9a73f49 |
201220112201 has 8 divisors (see below), whose sum is σ = 205552339200. Its totient is φ = 196890008128.
The previous prime is 201220112147. The next prime is 201220112209. The reversal of 201220112201 is 102211022102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201220112201 - 210 = 201220111177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201220112209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 338381 + ... + 718986.
It is an arithmetic number, because the mean of its divisors is an integer number (25694042400).
Almost surely, 2201220112201 is an apocalyptic number.
It is an amenable number.
201220112201 is a deficient number, since it is larger than the sum of its proper divisors (4332226999).
201220112201 is a wasteful number, since it uses less digits than its factorization.
201220112201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1061463.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 201220112201 its reverse (102211022102), we get a palindrome (303431134303).
Subtracting from 201220112201 its reverse (102211022102), we obtain a palindrome (99009090099).
The spelling of 201220112201 in words is "two hundred one billion, two hundred twenty million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •