Base | Representation |
---|---|
bin | 1011001000011111011010… |
… | …1011001101111001001101 |
3 | 1121100011212111220202200212 |
4 | 2302013312223031321031 |
5 | 3101022021042204131 |
6 | 42011112551132205 |
7 | 2402230003164161 |
oct | 262076653157115 |
9 | 47304774822625 |
10 | 12240500350541 |
11 | 399a19237a891 |
12 | 145835a974065 |
13 | 6aa374639b08 |
14 | 30462c8b4ca1 |
15 | 16360bc63a2b |
hex | b21f6acde4d |
12240500350541 has 2 divisors, whose sum is σ = 12240500350542. Its totient is φ = 12240500350540.
The previous prime is 12240500350531. The next prime is 12240500350577. The reversal of 12240500350541 is 14505300504221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6421429674916 + 5819070675625 = 2534054^2 + 2412275^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12240500350541 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12240500350498 and 12240500350507.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12240500350501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6120250175270 + 6120250175271.
It is an arithmetic number, because the mean of its divisors is an integer number (6120250175271).
Almost surely, 212240500350541 is an apocalyptic number.
It is an amenable number.
12240500350541 is a deficient number, since it is larger than the sum of its proper divisors (1).
12240500350541 is an equidigital number, since it uses as much as digits as its factorization.
12240500350541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24000, while the sum is 32.
Adding to 12240500350541 its reverse (14505300504221), we get a palindrome (26745800854762).
The spelling of 12240500350541 in words is "twelve trillion, two hundred forty billion, five hundred million, three hundred fifty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •