Base | Representation |
---|---|
bin | 111010001001… |
… | …100000010001 |
3 | 1001200102211222 |
4 | 322021200101 |
5 | 12400241111 |
6 | 1302414425 |
7 | 243365024 |
oct | 72114021 |
9 | 31612758 |
10 | 15243281 |
11 | 8671559 |
12 | 5131415 |
13 | 32092c1 |
14 | 204b1bb |
15 | 15117db |
hex | e89811 |
15243281 has 2 divisors, whose sum is σ = 15243282. Its totient is φ = 15243280.
The previous prime is 15243257. The next prime is 15243307. The reversal of 15243281 is 18234251.
It is an a-pointer prime, because the next prime (15243307) can be obtained adding 15243281 to its sum of digits (26).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14753281 + 490000 = 3841^2 + 700^2 .
It is a cyclic number.
It is not a de Polignac number, because 15243281 - 218 = 14981137 is a prime.
It is a super-2 number, since 2×152432812 = 464715231289922, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 15243281.
It is not a weakly prime, because it can be changed into another prime (15243211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7621640 + 7621641.
It is an arithmetic number, because the mean of its divisors is an integer number (7621641).
Almost surely, 215243281 is an apocalyptic number.
It is an amenable number.
15243281 is a deficient number, since it is larger than the sum of its proper divisors (1).
15243281 is an equidigital number, since it uses as much as digits as its factorization.
15243281 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1920, while the sum is 26.
The square root of 15243281 is about 3904.2644633785. The cubic root of 15243281 is about 247.9473581035.
The spelling of 15243281 in words is "fifteen million, two hundred forty-three thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •