Base | Representation |
---|---|
bin | 1110001001110001111… |
… | …0100101111110011101 |
3 | 212020121002021012222121 |
4 | 3202130132211332131 |
5 | 12440424204343031 |
6 | 303410515342541 |
7 | 23365215042556 |
oct | 3423436457635 |
9 | 766532235877 |
10 | 243143434141 |
11 | 941311478a3 |
12 | 3b1582b1a51 |
13 | 19c0b6c642a |
14 | baa7d5132d |
15 | 64d0dd4011 |
hex | 389c7a5f9d |
243143434141 has 2 divisors, whose sum is σ = 243143434142. Its totient is φ = 243143434140.
The previous prime is 243143434129. The next prime is 243143434151. The reversal of 243143434141 is 141434341342.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 242683331641 + 460102500 = 492629^2 + 21450^2 .
It is a cyclic number.
It is not a de Polignac number, because 243143434141 - 27 = 243143434013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 243143434097 and 243143434106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (243143434151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121571717070 + 121571717071.
It is an arithmetic number, because the mean of its divisors is an integer number (121571717071).
Almost surely, 2243143434141 is an apocalyptic number.
It is an amenable number.
243143434141 is a deficient number, since it is larger than the sum of its proper divisors (1).
243143434141 is an equidigital number, since it uses as much as digits as its factorization.
243143434141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 55296, while the sum is 34.
Adding to 243143434141 its reverse (141434341342), we get a palindrome (384577775483).
The spelling of 243143434141 in words is "two hundred forty-three billion, one hundred forty-three million, four hundred thirty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •