Base | Representation |
---|---|
bin | 110110110101000101111011… |
… | …101001110110111100001011 |
3 | 1011121211001021012221011212111 |
4 | 312311011323221312330023 |
5 | 223101341342412420202 |
6 | 2212511323201523151 |
7 | 101536002446121331 |
oct | 6665057351667413 |
9 | 1147731235834774 |
10 | 241143013404427 |
11 | 6a9211a5532832 |
12 | 2306716b3434b7 |
13 | a4728c4aac9b4 |
14 | 4379554069b51 |
15 | 1cd2a3aa846d7 |
hex | db517ba76f0b |
241143013404427 has 2 divisors, whose sum is σ = 241143013404428. Its totient is φ = 241143013404426.
The previous prime is 241143013404329. The next prime is 241143013404473. The reversal of 241143013404427 is 724404310341142.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 241143013404427 - 219 = 241143012880139 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 241143013404427.
It is not a weakly prime, because it can be changed into another prime (241143013474427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 120571506702213 + 120571506702214.
It is an arithmetic number, because the mean of its divisors is an integer number (120571506702214).
Almost surely, 2241143013404427 is an apocalyptic number.
241143013404427 is a deficient number, since it is larger than the sum of its proper divisors (1).
241143013404427 is an equidigital number, since it uses as much as digits as its factorization.
241143013404427 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 258048, while the sum is 40.
Adding to 241143013404427 its reverse (724404310341142), we get a palindrome (965547323745569).
The spelling of 241143013404427 in words is "two hundred forty-one trillion, one hundred forty-three billion, thirteen million, four hundred four thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •