Base | Representation |
---|---|
bin | 10000100111000010101… |
… | …010110101001101100011 |
3 | 11001010020101022210011202 |
4 | 100213002222311031203 |
5 | 122200123134410342 |
6 | 2232211120231415 |
7 | 145315520550434 |
oct | 20470252651543 |
9 | 4033211283152 |
10 | 1141432341347 |
11 | 400095888311 |
12 | 16527346b56b |
13 | 83837820b9c |
14 | 3d361da548b |
15 | 1ea580ba332 |
hex | 109c2ab5363 |
1141432341347 has 2 divisors, whose sum is σ = 1141432341348. Its totient is φ = 1141432341346.
The previous prime is 1141432341311. The next prime is 1141432341349. The reversal of 1141432341347 is 7431432341411.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1141432341347 - 228 = 1141163905891 is a prime.
Together with 1141432341349, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1141432341347.
It is not a weakly prime, because it can be changed into another prime (1141432341349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 570716170673 + 570716170674.
It is an arithmetic number, because the mean of its divisors is an integer number (570716170674).
Almost surely, 21141432341347 is an apocalyptic number.
1141432341347 is a deficient number, since it is larger than the sum of its proper divisors (1).
1141432341347 is an equidigital number, since it uses as much as digits as its factorization.
1141432341347 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 96768, while the sum is 38.
Adding to 1141432341347 its reverse (7431432341411), we get a palindrome (8572864682758).
The spelling of 1141432341347 in words is "one trillion, one hundred forty-one billion, four hundred thirty-two million, three hundred forty-one thousand, three hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •