Base | Representation |
---|---|
bin | 110111010101000110000101… |
… | …100001100000100101000101 |
3 | 1011220121021202110201110120212 |
4 | 313111012011201200211011 |
5 | 223343404312233242042 |
6 | 2221313510415005205 |
7 | 102153615422613425 |
oct | 6725060541404505 |
9 | 1156537673643525 |
10 | 243342202243397 |
11 | 705999372804a4 |
12 | 23361423209805 |
13 | a5a20c05a319a |
14 | 4413b7ada8485 |
15 | 1d1ed50ba7482 |
hex | dd5185860945 |
243342202243397 has 2 divisors, whose sum is σ = 243342202243398. Its totient is φ = 243342202243396.
The previous prime is 243342202243289. The next prime is 243342202243409. The reversal of 243342202243397 is 793342202243342.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 161006432146561 + 82335770096836 = 12688831^2 + 9073906^2 .
It is a cyclic number.
It is not a de Polignac number, because 243342202243397 - 244 = 225750016198981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (243342202246397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121671101121698 + 121671101121699.
It is an arithmetic number, because the mean of its divisors is an integer number (121671101121699).
Almost surely, 2243342202243397 is an apocalyptic number.
It is an amenable number.
243342202243397 is a deficient number, since it is larger than the sum of its proper divisors (1).
243342202243397 is an equidigital number, since it uses as much as digits as its factorization.
243342202243397 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10450944, while the sum is 50.
Subtracting 243342202243397 from its reverse (793342202243342), we obtain a palindrome (549999999999945).
The spelling of 243342202243397 in words is "two hundred forty-three trillion, three hundred forty-two billion, two hundred two million, two hundred forty-three thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •