Base | Representation |
---|---|
bin | 1011101101100010010… |
… | …1100011101111110101 |
3 | 201020100010110210022212 |
4 | 2323120211203233311 |
5 | 11244030232020041 |
6 | 232233033503205 |
7 | 20351656436435 |
oct | 2733045435765 |
9 | 636303423285 |
10 | 201202220021 |
11 | 78369453970 |
12 | 32bb2271b05 |
13 | 15c8640cc7a |
14 | 9a49a2c2c5 |
15 | 5378c9c8eb |
hex | 2ed8963bf5 |
201202220021 has 8 divisors (see below), whose sum is σ = 223213557600. Its totient is φ = 179810920240.
The previous prime is 201202219997. The next prime is 201202220033. The reversal of 201202220021 is 120022202102.
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 201202220021 - 230 = 200128478197 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 201202219978 and 201202220005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201202222021) 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, 155008766 + ... + 155010063.
It is an arithmetic number, because the mean of its divisors is an integer number (27901694700).
Almost surely, 2201202220021 is an apocalyptic number.
It is an amenable number.
201202220021 is a deficient number, since it is larger than the sum of its proper divisors (22011337579).
201202220021 is a wasteful number, since it uses less digits than its factorization.
201202220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310018899.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 201202220021 its reverse (120022202102), we get a palindrome (321224422123).
The spelling of 201202220021 in words is "two hundred one billion, two hundred two million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •