Base | Representation |
---|---|
bin | 110101010001101101001101… |
… | …100000111001110110111101 |
3 | 1010201122010102122210111202022 |
4 | 311101231031200321312331 |
5 | 221202442004233221014 |
6 | 2150202003403005525 |
7 | 100232400360125033 |
oct | 6521551540716675 |
9 | 1121563378714668 |
10 | 234313241304509 |
11 | 68728762201334 |
12 | 223435865098a5 |
13 | a09884a6b3983 |
14 | 41c0b6dc72553 |
15 | 1c15059beba8e |
hex | d51b4d839dbd |
234313241304509 has 2 divisors, whose sum is σ = 234313241304510. Its totient is φ = 234313241304508.
The previous prime is 234313241304433. The next prime is 234313241304529. The reversal of 234313241304509 is 905403142313432.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 127735430040100 + 106577811264409 = 11302010^2 + 10323653^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-234313241304509 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 234313241304509.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (234313241304529) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 117156620652254 + 117156620652255.
It is an arithmetic number, because the mean of its divisors is an integer number (117156620652255).
Almost surely, 2234313241304509 is an apocalyptic number.
It is an amenable number.
234313241304509 is a deficient number, since it is larger than the sum of its proper divisors (1).
234313241304509 is an equidigital number, since it uses as much as digits as its factorization.
234313241304509 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 933120, while the sum is 44.
The spelling of 234313241304509 in words is "two hundred thirty-four trillion, three hundred thirteen billion, two hundred forty-one million, three hundred four thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •