Base | Representation |
---|---|
bin | 10011101010010100101… |
… | …100111100100001010111 |
3 | 11210011110111101011212121 |
4 | 103222110230330201113 |
5 | 134114040310304033 |
6 | 2512405441400411 |
7 | 166420610052253 |
oct | 23522454744127 |
9 | 4704414334777 |
10 | 1351114541143 |
11 | 481005a31524 |
12 | 199a31639107 |
13 | 9a542a39663 |
14 | 49573d21263 |
15 | 2522b57462d |
hex | 13a94b3c857 |
1351114541143 has 2 divisors, whose sum is σ = 1351114541144. Its totient is φ = 1351114541142.
The previous prime is 1351114541089. The next prime is 1351114541149. The reversal of 1351114541143 is 3411454111531.
It is a strong prime.
It is an emirp because it is prime and its reverse (3411454111531) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1351114541143 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1351114541099 and 1351114541108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1351114541149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 675557270571 + 675557270572.
It is an arithmetic number, because the mean of its divisors is an integer number (675557270572).
Almost surely, 21351114541143 is an apocalyptic number.
1351114541143 is a deficient number, since it is larger than the sum of its proper divisors (1).
1351114541143 is an equidigital number, since it uses as much as digits as its factorization.
1351114541143 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14400, while the sum is 34.
Adding to 1351114541143 its reverse (3411454111531), we get a palindrome (4762568652674).
The spelling of 1351114541143 in words is "one trillion, three hundred fifty-one billion, one hundred fourteen million, five hundred forty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •