Base | Representation |
---|---|
bin | 10000010011011000111… |
… | …100110010111111011001 |
3 | 10222002202211000111010112 |
4 | 100103120330302333121 |
5 | 121323414304004423 |
6 | 2214401220054105 |
7 | 143640566015615 |
oct | 20233074627731 |
9 | 3862684014115 |
10 | 1120331313113 |
11 | 3a2147901501 |
12 | 161164834335 |
13 | 81853cc556c |
14 | 3c31d794345 |
15 | 1e220863a78 |
hex | 104d8f32fd9 |
1120331313113 has 2 divisors, whose sum is σ = 1120331313114. Its totient is φ = 1120331313112.
The previous prime is 1120331313091. The next prime is 1120331313119. The reversal of 1120331313113 is 3113131330211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1037002098889 + 83329214224 = 1018333^2 + 288668^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120331313113 - 28 = 1120331312857 is a prime.
It is a super-2 number, since 2×11203313131132 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1120331313119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560165656556 + 560165656557.
It is an arithmetic number, because the mean of its divisors is an integer number (560165656557).
Almost surely, 21120331313113 is an apocalyptic number.
It is an amenable number.
1120331313113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120331313113 is an equidigital number, since it uses as much as digits as its factorization.
1120331313113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 1120331313113 its reverse (3113131330211), we get a palindrome (4233462643324).
The spelling of 1120331313113 in words is "one trillion, one hundred twenty billion, three hundred thirty-one million, three hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •