Base | Representation |
---|---|
bin | 1010001100000011001001… |
… | …1001011000000110101101 |
3 | 1110122220122000111202101021 |
4 | 2203000302121120012231 |
5 | 2432013420234033401 |
6 | 35454103305214141 |
7 | 2234216660544055 |
oct | 243006231300655 |
9 | 43586560452337 |
10 | 11202120221101 |
11 | 362987990a657 |
12 | 130b067491351 |
13 | 633480a91014 |
14 | 2aa285088565 |
15 | 1465d5d3c2a1 |
hex | a30326581ad |
11202120221101 has 4 divisors (see below), whose sum is σ = 11202219654912. Its totient is φ = 11202020787292.
The previous prime is 11202120221099. The next prime is 11202120221213. The reversal of 11202120221101 is 10112202120211.
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.
It is a cyclic number.
It is not a de Polignac number, because 11202120221101 - 21 = 11202120221099 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11202120221401) 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, 49547725 + ... + 49773298.
It is an arithmetic number, because the mean of its divisors is an integer number (2800554913728).
Almost surely, 211202120221101 is an apocalyptic number.
It is an amenable number.
11202120221101 is a deficient number, since it is larger than the sum of its proper divisors (99433811).
11202120221101 is an equidigital number, since it uses as much as digits as its factorization.
11202120221101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99433810.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11202120221101 its reverse (10112202120211), we get a palindrome (21314322341312).
The spelling of 11202120221101 in words is "eleven trillion, two hundred two billion, one hundred twenty million, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •