Base | Representation |
---|---|
bin | 10000010011001011111… |
… | …100110111110011010101 |
3 | 10222002012121122122222122 |
4 | 100103023330313303111 |
5 | 121322442441312023 |
6 | 2214323425505325 |
7 | 143632310232122 |
oct | 20231374676325 |
9 | 3862177578878 |
10 | 1120113229013 |
11 | 3a2045797709 |
12 | 1611037a2245 |
13 | 8181aa78c0c |
14 | 3c2dc825749 |
15 | 1e20b6362c8 |
hex | 104cbf37cd5 |
1120113229013 has 2 divisors, whose sum is σ = 1120113229014. Its totient is φ = 1120113229012.
The previous prime is 1120113228977. The next prime is 1120113229019. The reversal of 1120113229013 is 3109223110211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 673216968004 + 446896261009 = 820498^2 + 668503^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120113229013 - 214 = 1120113212629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1120113229019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560056614506 + 560056614507.
It is an arithmetic number, because the mean of its divisors is an integer number (560056614507).
Almost surely, 21120113229013 is an apocalyptic number.
It is an amenable number.
1120113229013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120113229013 is an equidigital number, since it uses as much as digits as its factorization.
1120113229013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 26.
Adding to 1120113229013 its reverse (3109223110211), we get a palindrome (4229336339224).
The spelling of 1120113229013 in words is "one trillion, one hundred twenty billion, one hundred thirteen million, two hundred twenty-nine thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •