Base | Representation |
---|---|
bin | 1010001100000011001001… |
… | …1000100100100101111111 |
3 | 1110122220122000010000221211 |
4 | 2203000302120210211333 |
5 | 2432013420210310421 |
6 | 35454103300505251 |
7 | 2234216656004662 |
oct | 243006230444577 |
9 | 43586560100854 |
10 | 11202120010111 |
11 | 3629879786088 |
12 | 130b0673ab227 |
13 | 633480a18c84 |
14 | 2aa2850316d9 |
15 | 1465d5ce99e1 |
hex | a303262497f |
11202120010111 has 4 divisors (see below), whose sum is σ = 11475342449424. Its totient is φ = 10928897570800.
The previous prime is 11202120009989. The next prime is 11202120010153. The reversal of 11202120010111 is 11101002120211.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11202120010111 - 235 = 11167760271743 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11202120010091 and 11202120010100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11202120017111) 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, 136611219595 + ... + 136611219676.
It is an arithmetic number, because the mean of its divisors is an integer number (2868835612356).
Almost surely, 211202120010111 is an apocalyptic number.
11202120010111 is a deficient number, since it is larger than the sum of its proper divisors (273222439313).
11202120010111 is an equidigital number, since it uses as much as digits as its factorization.
11202120010111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 273222439312.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11202120010111 its reverse (11101002120211), we get a palindrome (22303122130322).
The spelling of 11202120010111 in words is "eleven trillion, two hundred two billion, one hundred twenty million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •