Base | Representation |
---|---|
bin | 11100111011001… |
… | …10100100000001 |
3 | 121220120110002101 |
4 | 32131212210001 |
5 | 444104004103 |
6 | 40024350401 |
7 | 6004262416 |
oct | 1635464401 |
9 | 556513071 |
10 | 242641153 |
11 | 114a67987 |
12 | 69315401 |
13 | 3b367061 |
14 | 2432210d |
15 | 1647da1d |
hex | e766901 |
242641153 has 32 divisors (see below), whose sum is σ = 282355200. Its totient is φ = 207028224.
The previous prime is 242641141. The next prime is 242641163. The reversal of 242641153 is 351146242.
It is a 3-Lehmer number, since φ(242641153) divides (242641153-1)3.
It is a cyclic number.
It is a Carmichael number.
It is a de Polignac number, because none of the positive numbers 2k-242641153 is a prime.
It is a deceptive number, since it divides R242641152.
It is not an unprimeable number, because it can be changed into a prime (242641163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 944001 + ... + 944257.
It is an arithmetic number, because the mean of its divisors is an integer number (8823600).
It is a Poulet number, since it divides 2242641152-1.
Almost surely, 2242641153 is an apocalyptic number.
It is an amenable number.
242641153 is a deficient number, since it is larger than the sum of its proper divisors (39714047).
242641153 is a wasteful number, since it uses less digits than its factorization.
242641153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 409.
The product of its digits is 5760, while the sum is 28.
The square root of 242641153 is about 15576.9429927698. The cubic root of 242641153 is about 623.7178219900.
Adding to 242641153 its reverse (351146242), we get a palindrome (593787395).
The spelling of 242641153 in words is "two hundred forty-two million, six hundred forty-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •