Base | Representation |
---|---|
bin | 10000001100101100010… |
… | …101101010110111100101 |
3 | 10221102012200001122110102 |
4 | 100030230111222313211 |
5 | 121214202421022111 |
6 | 2211211502033445 |
7 | 143264441231213 |
oct | 20145425526745 |
9 | 3842180048412 |
10 | 1113140407781 |
11 | 39a097816936 |
12 | 15b898578885 |
13 | 80c7929aaac |
14 | 3bc3a741cb3 |
15 | 1de4e3da13b |
hex | 1032c56ade5 |
1113140407781 has 2 divisors, whose sum is σ = 1113140407782. Its totient is φ = 1113140407780.
The previous prime is 1113140407727. The next prime is 1113140407783. The reversal of 1113140407781 is 1877040413111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 931890969025 + 181249438756 = 965345^2 + 425734^2 .
It is a cyclic number.
It is not a de Polignac number, because 1113140407781 - 210 = 1113140406757 is a prime.
It is a super-2 number, since 2×11131404077812 (a number of 25 digits) contains 22 as substring.
Together with 1113140407783, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1113140407783) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556570203890 + 556570203891.
It is an arithmetic number, because the mean of its divisors is an integer number (556570203891).
Almost surely, 21113140407781 is an apocalyptic number.
It is an amenable number.
1113140407781 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113140407781 is an equidigital number, since it uses as much as digits as its factorization.
1113140407781 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18816, while the sum is 38.
The spelling of 1113140407781 in words is "one trillion, one hundred thirteen billion, one hundred forty million, four hundred seven thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •