Base | Representation |
---|---|
bin | 10011000101000011110… |
… | …101011011110110000101 |
3 | 11122100012000210200220111 |
4 | 103011003311123312011 |
5 | 132440114343401222 |
6 | 2442151253433021 |
7 | 163503233345155 |
oct | 23050365336605 |
9 | 4570160720814 |
10 | 1311103106437 |
11 | 466043583413 |
12 | 19212593b771 |
13 | 968374b24c7 |
14 | 4765a018765 |
15 | 24188a7e777 |
hex | 13143d5bd85 |
1311103106437 has 2 divisors, whose sum is σ = 1311103106438. Its totient is φ = 1311103106436.
The previous prime is 1311103106413. The next prime is 1311103106459. The reversal of 1311103106437 is 7346013011131.
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., 1029100686916 + 282002419521 = 1014446^2 + 531039^2 .
It is a cyclic number.
It is not a de Polignac number, because 1311103106437 - 231 = 1308955622789 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1311103106399 and 1311103106408.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1311103101437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655551553218 + 655551553219.
It is an arithmetic number, because the mean of its divisors is an integer number (655551553219).
Almost surely, 21311103106437 is an apocalyptic number.
It is an amenable number.
1311103106437 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311103106437 is an equidigital number, since it uses as much as digits as its factorization.
1311103106437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 31.
Adding to 1311103106437 its reverse (7346013011131), we get a palindrome (8657116117568).
The spelling of 1311103106437 in words is "one trillion, three hundred eleven billion, one hundred three million, one hundred six thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •