Base | Representation |
---|---|
bin | 11011111011110… |
… | …10101110100101 |
3 | 121022221110101022 |
4 | 31331322232211 |
5 | 434442211031 |
6 | 35130340525 |
7 | 5543546555 |
oct | 1575725645 |
9 | 538843338 |
10 | 234335141 |
11 | 110304507 |
12 | 6658a745 |
13 | 39719561 |
14 | 2319d165 |
15 | 1588c97b |
hex | df7aba5 |
234335141 has 2 divisors, whose sum is σ = 234335142. Its totient is φ = 234335140.
The previous prime is 234335117. The next prime is 234335149. The reversal of 234335141 is 141533432.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 215238241 + 19096900 = 14671^2 + 4370^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-234335141 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 234335141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (234335149) 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, 117167570 + 117167571.
It is an arithmetic number, because the mean of its divisors is an integer number (117167571).
Almost surely, 2234335141 is an apocalyptic number.
It is an amenable number.
234335141 is a deficient number, since it is larger than the sum of its proper divisors (1).
234335141 is an equidigital number, since it uses as much as digits as its factorization.
234335141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4320, while the sum is 26.
The square root of 234335141 is about 15308.0090475542. The cubic root of 234335141 is about 616.5180652244.
Adding to 234335141 its reverse (141533432), we get a palindrome (375868573).
The spelling of 234335141 in words is "two hundred thirty-four million, three hundred thirty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •