Base | Representation |
---|---|
bin | 1010000110001110001101… |
… | …1011110001100111011011 |
3 | 1110022100020020201200001111 |
4 | 2201203203123301213123 |
5 | 2423343404331431021 |
6 | 35340105445401151 |
7 | 2224044121120462 |
oct | 241434333614733 |
9 | 43270206650044 |
10 | 11102011202011 |
11 | 35a0377992934 |
12 | 12b37891091b7 |
13 | 626bb8800852 |
14 | 2a54a97699d9 |
15 | 143bc726a8e1 |
hex | a18e36f19db |
11102011202011 has 16 divisors (see below), whose sum is σ = 11242627614720. Its totient is φ = 10961758653120.
The previous prime is 11102011201999. The next prime is 11102011202063. The reversal of 11102011202011 is 11020211020111.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 11102011202011 - 211 = 11102011199963 is a prime.
It is a super-3 number, since 3×111020112020113 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11102011201982 and 11102011202000.
It is not an unprimeable number, because it can be changed into a prime (11102011262011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 184612630 + ... + 184672756.
It is an arithmetic number, because the mean of its divisors is an integer number (702664225920).
Almost surely, 211102011202011 is an apocalyptic number.
11102011202011 is a deficient number, since it is larger than the sum of its proper divisors (140616412709).
11102011202011 is a wasteful number, since it uses less digits than its factorization.
11102011202011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63114.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11102011202011 its reverse (11020211020111), we get a palindrome (22122222222122).
The spelling of 11102011202011 in words is "eleven trillion, one hundred two billion, eleven million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •