Base | Representation |
---|---|
bin | 1010000000111011100101… |
… | …0111110111011100011101 |
3 | 1102222122121021101012002220 |
4 | 2200032321113313130131 |
5 | 2420401223433033041 |
6 | 35230233515335553 |
7 | 2214345413044602 |
oct | 240167127673435 |
9 | 42878537335086 |
10 | 11011111221021 |
11 | 35658712527aa |
12 | 129a03aa515b9 |
13 | 61b4603c0752 |
14 | 2a0d251186a9 |
15 | 141656db7d66 |
hex | a03b95f771d |
11011111221021 has 4 divisors (see below), whose sum is σ = 14681481628032. Its totient is φ = 7340740814012.
The previous prime is 11011111220983. The next prime is 11011111221113. The reversal of 11011111221021 is 12012211111011.
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 11011111221021 - 211 = 11011111218973 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011111021021) 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, 1835185203501 + ... + 1835185203506.
It is an arithmetic number, because the mean of its divisors is an integer number (3670370407008).
Almost surely, 211011111221021 is an apocalyptic number.
It is an amenable number.
11011111221021 is a deficient number, since it is larger than the sum of its proper divisors (3670370407011).
11011111221021 is an equidigital number, since it uses as much as digits as its factorization.
11011111221021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3670370407010.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 11011111221021 its reverse (12012211111011), we get a palindrome (23023322332032).
The spelling of 11011111221021 in words is "eleven trillion, eleven billion, one hundred eleven million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •