Base | Representation |
---|---|
bin | 1010000000111011111111… |
… | …0110111001111101101101 |
3 | 1102222122212212002210202111 |
4 | 2200032333312321331231 |
5 | 2420401434311133401 |
6 | 35230252403324021 |
7 | 2214351203611156 |
oct | 240167766717555 |
9 | 42878785083674 |
10 | 11011220021101 |
11 | 3565917704923 |
12 | 129a06b380611 |
13 | 61b479ac58b1 |
14 | 2a0d3575a92d |
15 | 141661709e51 |
hex | a03bfdb9f6d |
11011220021101 has 4 divisors (see below), whose sum is σ = 11166307627104. Its totient is φ = 10856132415100.
The previous prime is 11011220021083. The next prime is 11011220021143. The reversal of 11011220021101 is 10112002211011.
It is a happy number.
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 11011220021101 - 25 = 11011220021069 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 (11011220021201) 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, 77543802895 + ... + 77543803036.
It is an arithmetic number, because the mean of its divisors is an integer number (2791576906776).
Almost surely, 211011220021101 is an apocalyptic number.
It is an amenable number.
11011220021101 is a deficient number, since it is larger than the sum of its proper divisors (155087606003).
11011220021101 is an equidigital number, since it uses as much as digits as its factorization.
11011220021101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 155087606002.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11011220021101 its reverse (10112002211011), we get a palindrome (21123222232112).
The spelling of 11011220021101 in words is "eleven trillion, eleven billion, two hundred twenty million, twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •