Base | Representation |
---|---|
bin | 10000010100010101000… |
… | …110010100100111101001 |
3 | 10222012101010212121020201 |
4 | 100110111012110213221 |
5 | 121333001123134423 |
6 | 2215045305152201 |
7 | 144004601333602 |
oct | 20242506244751 |
9 | 3865333777221 |
10 | 1121340443113 |
11 | 3a26154a0840 |
12 | 1613a678b661 |
13 | 819850ab2c7 |
14 | 3c3b77dada9 |
15 | 1e27e24a2ad |
hex | 105151949e9 |
1121340443113 has 8 divisors (see below), whose sum is σ = 1229078023776. Its totient is φ = 1014569119200.
The previous prime is 1121340443033. The next prime is 1121340443117. The reversal of 1121340443113 is 3113440431211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1121340443113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1121340443117) 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, 241561756 + ... + 241566397.
It is an arithmetic number, because the mean of its divisors is an integer number (153634752972).
Almost surely, 21121340443113 is an apocalyptic number.
It is an amenable number.
1121340443113 is a deficient number, since it is larger than the sum of its proper divisors (107737580663).
1121340443113 is a wasteful number, since it uses less digits than its factorization.
1121340443113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 483128375.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 1121340443113 its reverse (3113440431211), we get a palindrome (4234780874324).
The spelling of 1121340443113 in words is "one trillion, one hundred twenty-one billion, three hundred forty million, four hundred forty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •