Base | Representation |
---|---|
bin | 1011111011001000000011… |
… | …1011110001011101001111 |
3 | 1201102100020112212022021012 |
4 | 2332302000323301131033 |
5 | 3204300101223340421 |
6 | 43514500335155435 |
7 | 2522124005454500 |
oct | 276620073613517 |
9 | 51370215768235 |
10 | 13110403340111 |
11 | 41a50aa997240 |
12 | 1578a73675b7b |
13 | 7413c88c5cbc |
14 | 3347929dcba7 |
15 | 17b071da295b |
hex | bec80ef174f |
13110403340111 has 12 divisors (see below), whose sum is σ = 16637320751400. Its totient is φ = 10215898706160.
The previous prime is 13110403340107. The next prime is 13110403340117. The reversal of 13110403340111 is 11104330401131.
It is not a de Polignac number, because 13110403340111 - 22 = 13110403340107 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13110403340117) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12161783636 + ... + 12161784713.
It is an arithmetic number, because the mean of its divisors is an integer number (1386443395950).
Almost surely, 213110403340111 is an apocalyptic number.
13110403340111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13110403340111 is a deficient number, since it is larger than the sum of its proper divisors (3526917411289).
13110403340111 is a wasteful number, since it uses less digits than its factorization.
13110403340111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24323568374 (or 24323568367 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 13110403340111 its reverse (11104330401131), we get a palindrome (24214733741242).
The spelling of 13110403340111 in words is "thirteen trillion, one hundred ten billion, four hundred three million, three hundred forty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •