Base | Representation |
---|---|
bin | 11100011100110… |
… | …01011101101101 |
3 | 121122001221120201 |
4 | 32032121131231 |
5 | 442043432331 |
6 | 35403113501 |
7 | 5625352111 |
oct | 1616313555 |
9 | 548057521 |
10 | 238655341 |
11 | 112795321 |
12 | 67b12891 |
13 | 3a59caa2 |
14 | 239a5741 |
15 | 15e42a61 |
hex | e39976d |
238655341 has 2 divisors, whose sum is σ = 238655342. Its totient is φ = 238655340.
The previous prime is 238655321. The next prime is 238655357. The reversal of 238655341 is 143556832.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 149352841 + 89302500 = 12221^2 + 9450^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-238655341 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 238655341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (238655321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 119327670 + 119327671.
It is an arithmetic number, because the mean of its divisors is an integer number (119327671).
Almost surely, 2238655341 is an apocalyptic number.
It is an amenable number.
238655341 is a deficient number, since it is larger than the sum of its proper divisors (1).
238655341 is an equidigital number, since it uses as much as digits as its factorization.
238655341 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 86400, while the sum is 37.
The square root of 238655341 is about 15448.4737433832. The cubic root of 238655341 is about 620.2837246339.
It can be divided in two parts, 23 and 8655341, that added together give a square (8655364 = 29422).
The spelling of 238655341 in words is "two hundred thirty-eight million, six hundred fifty-five thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •