Base | Representation |
---|---|
bin | 10000001101100001111… |
… | …101100000101001010001 |
3 | 10221111112100212220111120 |
4 | 100031201331200221101 |
5 | 121223023222402423 |
6 | 2211441040232453 |
7 | 143325644063523 |
oct | 20154175405121 |
9 | 3844470786446 |
10 | 1114040044113 |
11 | 39a50961aa37 |
12 | 15baa990b729 |
13 | 81090797a99 |
14 | 3bcc4005a13 |
15 | 1dea3393ee3 |
hex | 10361f60a51 |
1114040044113 has 8 divisors (see below), whose sum is σ = 1521615670176. Its totient is φ = 724578890400.
The previous prime is 1114040044109. The next prime is 1114040044153. The reversal of 1114040044113 is 3114400404111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1114040044113 - 22 = 1114040044109 is a prime.
It is a super-3 number, since 3×11140400441133 (a number of 37 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (1114040044153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4528617943 + ... + 4528618188.
It is an arithmetic number, because the mean of its divisors is an integer number (190201958772).
Almost surely, 21114040044113 is an apocalyptic number.
It is an amenable number.
1114040044113 is a deficient number, since it is larger than the sum of its proper divisors (407575626063).
1114040044113 is an equidigital number, since it uses as much as digits as its factorization.
1114040044113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9057236175.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 1114040044113 its reverse (3114400404111), we get a palindrome (4228440448224).
The spelling of 1114040044113 in words is "one trillion, one hundred fourteen billion, forty million, forty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •