Base | Representation |
---|---|
bin | 10100110111011010… |
… | …00100111111110101 |
3 | 1001220200221201221211 |
4 | 22123231010333311 |
5 | 140420232020041 |
6 | 5051330241421 |
7 | 544413204406 |
oct | 123355047765 |
9 | 31820851854 |
10 | 11202220021 |
11 | 48293a7783 |
12 | 2207726271 |
13 | 1096aab275 |
14 | 783aad9ad |
15 | 4586d6481 |
hex | 29bb44ff5 |
11202220021 has 4 divisors (see below), whose sum is σ = 11588503500. Its totient is φ = 10815936544.
The previous prime is 11202220009. The next prime is 11202220147. The reversal of 11202220021 is 12002220211.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4594806225 + 6607413796 = 67785^2 + 81286^2 .
It is a cyclic number.
It is not a de Polignac number, because 11202220021 - 211 = 11202217973 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11202219983 and 11202220010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11202224021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 193141696 + ... + 193141753.
It is an arithmetic number, because the mean of its divisors is an integer number (2897125875).
Almost surely, 211202220021 is an apocalyptic number.
It is an amenable number.
11202220021 is a deficient number, since it is larger than the sum of its proper divisors (386283479).
11202220021 is an equidigital number, since it uses as much as digits as its factorization.
11202220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 386283478.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 11202220021 its reverse (12002220211), we get a palindrome (23204440232).
The spelling of 11202220021 in words is "eleven billion, two hundred two million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •