Base | Representation |
---|---|
bin | 1010001101001001100001… |
… | …1000011010000001001011 |
3 | 1110201201101120001102222120 |
4 | 2203102120120122001023 |
5 | 2432321112321041021 |
6 | 35510510014422323 |
7 | 2235456054505551 |
oct | 243223030320113 |
9 | 43651346042876 |
10 | 11221011112011 |
11 | 3636893272598 |
12 | 1312859b019a3 |
13 | 6351a1748a8c |
14 | 2ab157d3dbd1 |
15 | 146d3e5232c6 |
hex | a349861a04b |
11221011112011 has 8 divisors (see below), whose sum is σ = 14961724855440. Its totient is φ = 7480485721632.
The previous prime is 11221011112007. The next prime is 11221011112037. The reversal of 11221011112011 is 11021111012211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11221011112011 - 22 = 11221011112007 is a prime.
It is a super-2 number, since 2×112210111120112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11221011112081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 46949196 + ... + 47187593.
It is an arithmetic number, because the mean of its divisors is an integer number (1870215606930).
Almost surely, 211221011112011 is an apocalyptic number.
11221011112011 is a deficient number, since it is larger than the sum of its proper divisors (3740713743429).
11221011112011 is an equidigital number, since it uses as much as digits as its factorization.
11221011112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94176525.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 11221011112011 its reverse (11021111012211), we get a palindrome (22242122124222).
The spelling of 11221011112011 in words is "eleven trillion, two hundred twenty-one billion, eleven million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •