Base | Representation |
---|---|
bin | 1010000110111010111001… |
… | …0001001101100000011110 |
3 | 1110100111012001120011001010 |
4 | 2201232232101031200132 |
5 | 2424042440030021420 |
6 | 35345411504000050 |
7 | 2224650245331432 |
oct | 241565621154036 |
9 | 43314161504033 |
10 | 11114004142110 |
11 | 35a5471662281 |
12 | 12b5b75600026 |
13 | 62807a362acc |
14 | 2a5cc646a9c2 |
15 | 14417a0944e0 |
hex | a1bae44d81e |
11114004142110 has 16 divisors (see below), whose sum is σ = 26673609941136. Its totient is φ = 2963734437888.
The previous prime is 11114004142103. The next prime is 11114004142117. The reversal of 11114004142110 is 1124140041111.
It is an interprime number because it is at equal distance from previous prime (11114004142103) and next prime (11114004142117).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11114004142117) 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, 185233402339 + ... + 185233402398.
It is an arithmetic number, because the mean of its divisors is an integer number (1667100621321).
Almost surely, 211114004142110 is an apocalyptic number.
11114004142110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11114004142110 is an abundant number, since it is smaller than the sum of its proper divisors (15559605799026).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11114004142110 is a wasteful number, since it uses less digits than its factorization.
11114004142110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 370466804747.
The product of its (nonzero) digits is 128, while the sum is 21.
Adding to 11114004142110 its reverse (1124140041111), we get a palindrome (12238144183221).
The spelling of 11114004142110 in words is "eleven trillion, one hundred fourteen billion, four million, one hundred forty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •