Base | Representation |
---|---|
bin | 1010000000010110010010… |
… | …1110110000000001111011 |
3 | 1102221200202122210112220211 |
4 | 2200011210232300001323 |
5 | 2420220223403101021 |
6 | 35221500334331551 |
7 | 2213542354336165 |
oct | 240054456600173 |
9 | 42850678715824 |
10 | 11001101222011 |
11 | 35615a492934a |
12 | 1298106659bb7 |
13 | 61a526612004 |
14 | 2a0655911935 |
15 | 14126d1d23e1 |
hex | a0164bb007b |
11001101222011 has 8 divisors (see below), whose sum is σ = 11258741748240. Its totient is φ = 10746439199232.
The previous prime is 11001101222003. The next prime is 11001101222017. The reversal of 11001101222011 is 11022210110011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11001101222011 - 23 = 11001101222003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11001101221982 and 11001101222000.
It is not an unprimeable number, because it can be changed into a prime (11001101222017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 744618390 + ... + 744633163.
It is an arithmetic number, because the mean of its divisors is an integer number (1407342718530).
Almost surely, 211001101222011 is an apocalyptic number.
11001101222011 is a deficient number, since it is larger than the sum of its proper divisors (257640526229).
11001101222011 is an equidigital number, since it uses as much as digits as its factorization.
11001101222011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1489251725.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11001101222011 its reverse (11022210110011), we get a palindrome (22023311332022).
The spelling of 11001101222011 in words is "eleven trillion, one billion, one hundred one million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •