Base | Representation |
---|---|
bin | 110111010011011111110001… |
… | …010011010010101101010101 |
3 | 1011220012210012001222121111212 |
4 | 313103133301103102231111 |
5 | 223340104313333244242 |
6 | 2221151221153511205 |
7 | 102142646110221035 |
oct | 6723376123225525 |
9 | 1156183161877455 |
10 | 243232341306197 |
11 | 70557290682321 |
12 | 23344082b72505 |
13 | a594932b45b79 |
14 | 440c7184638c5 |
15 | 1d1c070dcd782 |
hex | dd37f14d2b55 |
243232341306197 has 2 divisors, whose sum is σ = 243232341306198. Its totient is φ = 243232341306196.
The previous prime is 243232341306169. The next prime is 243232341306233. The reversal of 243232341306197 is 791603143232342.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 130831824454276 + 112400516851921 = 11438174^2 + 10601911^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-243232341306197 is a prime.
It is a super-2 number, since 2×2432323413061972 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (243232341306397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121616170653098 + 121616170653099.
It is an arithmetic number, because the mean of its divisors is an integer number (121616170653099).
Almost surely, 2243232341306197 is an apocalyptic number.
It is an amenable number.
243232341306197 is a deficient number, since it is larger than the sum of its proper divisors (1).
243232341306197 is an equidigital number, since it uses as much as digits as its factorization.
243232341306197 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3919104, while the sum is 50.
The spelling of 243232341306197 in words is "two hundred forty-three trillion, two hundred thirty-two billion, three hundred forty-one million, three hundred six thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •