Base | Representation |
---|---|
bin | 10100110111011010… |
… | …01010111001101001 |
3 | 1001220200222222010101 |
4 | 22123231022321221 |
5 | 140420233303301 |
6 | 5051330545401 |
7 | 544413335041 |
oct | 123355127151 |
9 | 31820888111 |
10 | 11202244201 |
11 | 4829413965 |
12 | 2207738261 |
13 | 1096ab9285 |
14 | 783ab8721 |
15 | 4586dd701 |
hex | 29bb4ae69 |
11202244201 has 4 divisors (see below), whose sum is σ = 11462761552. Its totient is φ = 10941726852.
The previous prime is 11202244159. The next prime is 11202244237. The reversal of 11202244201 is 10244220211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 10244220211 = 571 ⋅17940841.
It is not a de Polignac number, because 11202244201 - 217 = 11202113129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11202244301) 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 in 3 ways as a sum of consecutive naturals, for example, 130258611 + ... + 130258696.
It is an arithmetic number, because the mean of its divisors is an integer number (2865690388).
Almost surely, 211202244201 is an apocalyptic number.
It is an amenable number.
11202244201 is a deficient number, since it is larger than the sum of its proper divisors (260517351).
11202244201 is an equidigital number, since it uses as much as digits as its factorization.
11202244201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 260517350.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 11202244201 its reverse (10244220211), we get a palindrome (21446464412).
The spelling of 11202244201 in words is "eleven billion, two hundred two million, two hundred forty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •