Base | Representation |
---|---|
bin | 1010000110010010010100… |
… | …0111111111001111111111 |
3 | 1110022110002001112121200111 |
4 | 2201210211013333033333 |
5 | 2423403134001424411 |
6 | 35340411055410451 |
7 | 2224113332650054 |
oct | 241444507771777 |
9 | 43273061477614 |
10 | 11103113311231 |
11 | 35a08930088a7 |
12 | 12b3a36223a27 |
13 | 627032c3c596 |
14 | 2a5571c9702b |
15 | 143c3ddbb721 |
hex | a19251ff3ff |
11103113311231 has 4 divisors (see below), whose sum is σ = 11103125462352. Its totient is φ = 11103101160112.
The previous prime is 11103113311211. The next prime is 11103113311237. The reversal of 11103113311231 is 13211331130111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11103113311231 - 29 = 11103113310719 is a prime.
It is a super-2 number, since 2×111031133112312 (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 (11103113311237) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4582651 + ... + 6573196.
It is an arithmetic number, because the mean of its divisors is an integer number (2775781365588).
Almost surely, 211103113311231 is an apocalyptic number.
11103113311231 is a deficient number, since it is larger than the sum of its proper divisors (12151121).
11103113311231 is an equidigital number, since it uses as much as digits as its factorization.
11103113311231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12151120.
The product of its (nonzero) digits is 162, while the sum is 22.
Adding to 11103113311231 its reverse (13211331130111), we get a palindrome (24314444441342).
The spelling of 11103113311231 in words is "eleven trillion, one hundred three billion, one hundred thirteen million, three hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •