Base | Representation |
---|---|
bin | 10011010100100… |
… | …000110011010101 |
3 | 211120221020102222 |
4 | 103110200303111 |
5 | 1130440104331 |
6 | 52055312125 |
7 | 11014116143 |
oct | 2324406325 |
9 | 746836388 |
10 | 324144341 |
11 | 156a75494 |
12 | 9067b645 |
13 | 522026b1 |
14 | 3109a593 |
15 | 1d6ccb7b |
hex | 13520cd5 |
324144341 has 2 divisors, whose sum is σ = 324144342. Its totient is φ = 324144340.
The previous prime is 324144283. The next prime is 324144349. The reversal of 324144341 is 143441423.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 192376900 + 131767441 = 13870^2 + 11479^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-324144341 is a prime.
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 324144341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (324144349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 162072170 + 162072171.
It is an arithmetic number, because the mean of its divisors is an integer number (162072171).
Almost surely, 2324144341 is an apocalyptic number.
It is an amenable number.
324144341 is a deficient number, since it is larger than the sum of its proper divisors (1).
324144341 is an equidigital number, since it uses as much as digits as its factorization.
324144341 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4608, while the sum is 26.
The square root of 324144341 is about 18004.0090257698. The cubic root of 324144341 is about 686.9305237222.
Adding to 324144341 its reverse (143441423), we get a palindrome (467585764).
The spelling of 324144341 in words is "three hundred twenty-four million, one hundred forty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •