Base | Representation |
---|---|
bin | 1110001010001001100… |
… | …0100001000101011001 |
3 | 212020211222200112000112 |
4 | 3202202120201011121 |
5 | 12441130040121122 |
6 | 303424415014105 |
7 | 23400530113544 |
oct | 3424230410531 |
9 | 766758615015 |
10 | 243242504537 |
11 | 9418206395a |
12 | 3b18550a335 |
13 | 19c260a2a76 |
14 | bab717d85b |
15 | 64d99532e2 |
hex | 38a2621159 |
243242504537 has 2 divisors, whose sum is σ = 243242504538. Its totient is φ = 243242504536.
The previous prime is 243242504459. The next prime is 243242504563. The reversal of 243242504537 is 735405242342.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 173664726361 + 69577778176 = 416731^2 + 263776^2 .
It is a cyclic number.
It is not a de Polignac number, because 243242504537 - 224 = 243225727321 is a prime.
It is a super-3 number, since 3×2432425045373 (a number of 35 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 243242504494 and 243242504503.
It is not a weakly prime, because it can be changed into another prime (243242504567) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121621252268 + 121621252269.
It is an arithmetic number, because the mean of its divisors is an integer number (121621252269).
Almost surely, 2243242504537 is an apocalyptic number.
It is an amenable number.
243242504537 is a deficient number, since it is larger than the sum of its proper divisors (1).
243242504537 is an equidigital number, since it uses as much as digits as its factorization.
243242504537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 806400, while the sum is 41.
Adding to 243242504537 its reverse (735405242342), we get a palindrome (978647746879).
The spelling of 243242504537 in words is "two hundred forty-three billion, two hundred forty-two million, five hundred four thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •