Base | Representation |
---|---|
bin | 10000001100101011010… |
… | …100011100111000010001 |
3 | 10221102011110220001020210 |
4 | 100030223110130320101 |
5 | 121214134031423441 |
6 | 2211210051354333 |
7 | 143264143013553 |
oct | 20145324347021 |
9 | 3842143801223 |
10 | 1113123311121 |
11 | 39a0890a9968 |
12 | 15b8928b29a9 |
13 | 80c75893023 |
14 | 3bc383714d3 |
15 | 1de4cb5e616 |
hex | 1032b51ce11 |
1113123311121 has 16 divisors (see below), whose sum is σ = 1520135566400. Its totient is φ = 724299859008.
The previous prime is 1113123311071. The next prime is 1113123311171. The reversal of 1113123311121 is 1211133213111.
It is an interprime number because it is at equal distance from previous prime (1113123311071) and next prime (1113123311171).
It is not a de Polignac number, because 1113123311121 - 217 = 1113123180049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1113123311171) 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 15 ways as a sum of consecutive naturals, for example, 25381426 + ... + 25425243.
It is an arithmetic number, because the mean of its divisors is an integer number (95008472900).
Almost surely, 21113123311121 is an apocalyptic number.
It is an amenable number.
1113123311121 is a deficient number, since it is larger than the sum of its proper divisors (407012255279).
1113123311121 is a wasteful number, since it uses less digits than its factorization.
1113123311121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50806848.
The product of its digits is 108, while the sum is 21.
Adding to 1113123311121 its reverse (1211133213111), we get a palindrome (2324256524232).
The spelling of 1113123311121 in words is "one trillion, one hundred thirteen billion, one hundred twenty-three million, three hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •