Base | Representation |
---|---|
bin | 10000101000101000000… |
… | …111010101101100011001 |
3 | 11001021121222212220200211 |
4 | 100220220013111230121 |
5 | 122212114341010431 |
6 | 2233052035331121 |
7 | 145405635224554 |
oct | 20505007255431 |
9 | 4037558786624 |
10 | 1143134313241 |
11 | 400889577a58 |
12 | 165669450aa1 |
13 | 83a4930ab4b |
14 | 3d48404169b |
15 | 1eb0770d2b1 |
hex | 10a281d5b19 |
1143134313241 has 2 divisors, whose sum is σ = 1143134313242. Its totient is φ = 1143134313240.
The previous prime is 1143134313239. The next prime is 1143134313281. The reversal of 1143134313241 is 1423134313411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1142750310025 + 384003216 = 1068995^2 + 19596^2 .
It is a cyclic number.
It is not a de Polignac number, because 1143134313241 - 21 = 1143134313239 is a prime.
Together with 1143134313239, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1143134313281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 571567156620 + 571567156621.
It is an arithmetic number, because the mean of its divisors is an integer number (571567156621).
Almost surely, 21143134313241 is an apocalyptic number.
It is an amenable number.
1143134313241 is a deficient number, since it is larger than the sum of its proper divisors (1).
1143134313241 is an equidigital number, since it uses as much as digits as its factorization.
1143134313241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10368, while the sum is 31.
Adding to 1143134313241 its reverse (1423134313411), we get a palindrome (2566268626652).
The spelling of 1143134313241 in words is "one trillion, one hundred forty-three billion, one hundred thirty-four million, three hundred thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •