Base | Representation |
---|---|
bin | 10100001011011… |
… | …011100000011001 |
3 | 212121000122100121 |
4 | 110023123200121 |
5 | 1143131244234 |
6 | 53332033241 |
7 | 11250355513 |
oct | 2413334031 |
9 | 777018317 |
10 | 338540569 |
11 | 1641085a4 |
12 | 95462821 |
13 | 551a3283 |
14 | 32d66bb3 |
15 | 1eac34b4 |
hex | 142db819 |
338540569 has 2 divisors, whose sum is σ = 338540570. Its totient is φ = 338540568.
The previous prime is 338540551. The next prime is 338540581. The reversal of 338540569 is 965045833.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 201299344 + 137241225 = 14188^2 + 11715^2 .
It is an emirp because it is prime and its reverse (965045833) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 338540569 - 27 = 338540441 is a prime.
It is a super-2 number, since 2×3385405692 = 229219433717687522, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (338540539) 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, 169270284 + 169270285.
It is an arithmetic number, because the mean of its divisors is an integer number (169270285).
Almost surely, 2338540569 is an apocalyptic number.
It is an amenable number.
338540569 is a deficient number, since it is larger than the sum of its proper divisors (1).
338540569 is an equidigital number, since it uses as much as digits as its factorization.
338540569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 388800, while the sum is 43.
The square root of 338540569 is about 18399.4719761193. The cubic root of 338540569 is about 696.9531306932.
The spelling of 338540569 in words is "three hundred thirty-eight million, five hundred forty thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •