Base | Representation |
---|---|
bin | 10000010100010101001… |
… | …100010000111111011001 |
3 | 10222012101020210202102102 |
4 | 100110111030100333121 |
5 | 121333002023013423 |
6 | 2215045402413145 |
7 | 144004620513065 |
oct | 20242514207731 |
9 | 3865336722372 |
10 | 1121342001113 |
11 | 3a2616365344 |
12 | 1613a72011b5 |
13 | 819855054b9 |
14 | 3c3b7ac4aa5 |
15 | 1e27e456c28 |
hex | 10515310fd9 |
1121342001113 has 4 divisors (see below), whose sum is σ = 1125390167460. Its totient is φ = 1117293834768.
The previous prime is 1121342001089. The next prime is 1121342001119. The reversal of 1121342001113 is 3111002431211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 58684093504 + 1062657907609 = 242248^2 + 1030853^2 .
It is a cyclic number.
It is not a de Polignac number, because 1121342001113 - 226 = 1121274892249 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1121342001119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2024082758 + ... + 2024083311.
It is an arithmetic number, because the mean of its divisors is an integer number (281347541865).
Almost surely, 21121342001113 is an apocalyptic number.
It is an amenable number.
1121342001113 is a deficient number, since it is larger than the sum of its proper divisors (4048166347).
1121342001113 is an equidigital number, since it uses as much as digits as its factorization.
1121342001113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4048166346.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 1121342001113 its reverse (3111002431211), we get a palindrome (4232344432324).
The spelling of 1121342001113 in words is "one trillion, one hundred twenty-one billion, three hundred forty-two million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •