Base | Representation |
---|---|
bin | 1010000110010010010011… |
… | …1011110100011101011111 |
3 | 1110022110001211112112221022 |
4 | 2201210210323310131133 |
5 | 2423403132142340221 |
6 | 35340410503154355 |
7 | 2224113263563025 |
oct | 241444473643537 |
9 | 43273054475838 |
10 | 11103110121311 |
11 | 35a089122a1aa |
12 | 12b3a351459bb |
13 | 627032393660 |
14 | 2a55716a6715 |
15 | 143c3d98b4ab |
hex | a1924ef475f |
11103110121311 has 16 divisors (see below), whose sum is σ = 12660683057568. Its totient is φ = 9646047129600.
The previous prime is 11103110121307. The next prime is 11103110121317. The reversal of 11103110121311 is 11312101130111.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 11103110121311 - 22 = 11103110121307 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 11103110121311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11103110121317) 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, 32362991 + ... + 32704271.
It is an arithmetic number, because the mean of its divisors is an integer number (791292691098).
Almost surely, 211103110121311 is an apocalyptic number.
11103110121311 is a deficient number, since it is larger than the sum of its proper divisors (1557572936257).
11103110121311 is a wasteful number, since it uses less digits than its factorization.
11103110121311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 488522.
The product of its (nonzero) digits is 18, while the sum is 17.
Adding to 11103110121311 its reverse (11312101130111), we get a palindrome (22415211251422).
The spelling of 11103110121311 in words is "eleven trillion, one hundred three billion, one hundred ten million, one hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •