Base | Representation |
---|---|
bin | 1010000110001110100011… |
… | …0110001110001110010011 |
3 | 1110022100110120121202022011 |
4 | 2201203220312032032103 |
5 | 2423344101104133021 |
6 | 35340122452123351 |
7 | 2224046303064061 |
oct | 241435066161623 |
9 | 43270416552264 |
10 | 11102102021011 |
11 | 35a0414183561 |
12 | 12b37b3606557 |
13 | 626c0157b4c1 |
14 | 2a54b784b031 |
15 | 143bd0209de1 |
hex | a18e8d8e393 |
11102102021011 has 8 divisors (see below), whose sum is σ = 11128626649584. Its totient is φ = 11075583985440.
The previous prime is 11102102020951. The next prime is 11102102021041. The reversal of 11102102021011 is 11012020120111.
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 a de Polignac number, because none of the positive numbers 2k-11102102021011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11102102020982 and 11102102021000.
It is not an unprimeable number, because it can be changed into a prime (11102102021041) 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, 1731885 + ... + 5020321.
It is an arithmetic number, because the mean of its divisors is an integer number (1391078331198).
Almost surely, 211102102021011 is an apocalyptic number.
11102102021011 is a deficient number, since it is larger than the sum of its proper divisors (26524628573).
11102102021011 is an equidigital number, since it uses as much as digits as its factorization.
11102102021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3296501.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11102102021011 its reverse (11012020120111), we get a palindrome (22114122141122).
The spelling of 11102102021011 in words is "eleven trillion, one hundred two billion, one hundred two million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •