Base | Representation |
---|---|
bin | 1010000110010011000110… |
… | …0001001000111100000111 |
3 | 1110022110121112210001010210 |
4 | 2201210301201020330013 |
5 | 2423404100213343421 |
6 | 35340443444050503 |
7 | 2224121436151344 |
oct | 241446141107407 |
9 | 43273545701123 |
10 | 11103321231111 |
11 | 35a098a41010a |
12 | 12b3a93993a33 |
13 | 62706703a6b5 |
14 | 2a559173b7cb |
15 | 143c5228c576 |
hex | a1931848f07 |
11103321231111 has 8 divisors (see below), whose sum is σ = 15204547992304. Its totient is φ = 7202154312000.
The previous prime is 11103321231109. The next prime is 11103321231169. The reversal of 11103321231111 is 11113212330111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11103321231111 - 21 = 11103321231109 is a prime.
It is a super-2 number, since 2×111033212311112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11103321231011) 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, 50014960390 + ... + 50014960611.
It is an arithmetic number, because the mean of its divisors is an integer number (1900568499038).
Almost surely, 211103321231111 is an apocalyptic number.
11103321231111 is a deficient number, since it is larger than the sum of its proper divisors (4101226761193).
11103321231111 is a wasteful number, since it uses less digits than its factorization.
11103321231111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100029921041.
The product of its (nonzero) digits is 108, while the sum is 21.
Adding to 11103321231111 its reverse (11113212330111), we get a palindrome (22216533561222).
The spelling of 11103321231111 in words is "eleven trillion, one hundred three billion, three hundred twenty-one million, two hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.256 sec. • engine limits •