Base | Representation |
---|---|
bin | 10000001100100110100… |
… | …110010100111010100001 |
3 | 10221101221221212021010022 |
4 | 100030212212110322201 |
5 | 121214003243023014 |
6 | 2211154142043225 |
7 | 143262161561465 |
oct | 20144646247241 |
9 | 3841857767108 |
10 | 1113044111009 |
11 | 39a048424726 |
12 | 15b870279515 |
13 | 80c62352a5c |
14 | 3bc2ba364a5 |
15 | 1de45c17a8e |
hex | 10326994ea1 |
1113044111009 has 2 divisors, whose sum is σ = 1113044111010. Its totient is φ = 1113044111008.
The previous prime is 1113044110993. The next prime is 1113044111111. The reversal of 1113044111009 is 9001114403111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1096376526400 + 16667584609 = 1047080^2 + 129103^2 .
It is an emirp because it is prime and its reverse (9001114403111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1113044111009 - 24 = 1113044110993 is a prime.
It is a super-2 number, since 2×11130441110092 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1113044111609) 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 as a sum of consecutive naturals, namely, 556522055504 + 556522055505.
It is an arithmetic number, because the mean of its divisors is an integer number (556522055505).
Almost surely, 21113044111009 is an apocalyptic number.
It is an amenable number.
1113044111009 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113044111009 is an equidigital number, since it uses as much as digits as its factorization.
1113044111009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 26.
The spelling of 1113044111009 in words is "one trillion, one hundred thirteen billion, forty-four million, one hundred eleven thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •