Base | Representation |
---|---|
bin | 11100111000010… |
… | …10100000000101 |
3 | 121212212021211022 |
4 | 32130022200011 |
5 | 444004422234 |
6 | 40012320525 |
7 | 6001132145 |
oct | 1634124005 |
9 | 555767738 |
10 | 242264069 |
11 | 11482a643 |
12 | 69173145 |
13 | 3b264528 |
14 | 24264925 |
15 | 16406e2e |
hex | e70a805 |
242264069 has 2 divisors, whose sum is σ = 242264070. Its totient is φ = 242264068.
The previous prime is 242264063. The next prime is 242264111. The reversal of 242264069 is 960462242.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 212430625 + 29833444 = 14575^2 + 5462^2 .
It is a cyclic number.
It is not a de Polignac number, because 242264069 - 212 = 242259973 is a prime.
It is a super-2 number, since 2×2422640692 = 117383758256873522, which contains 22 as substring.
It is a Chen prime.
It is equal to p13278914 and since 242264069 and 13278914 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (242264063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121132034 + 121132035.
It is an arithmetic number, because the mean of its divisors is an integer number (121132035).
Almost surely, 2242264069 is an apocalyptic number.
It is an amenable number.
242264069 is a deficient number, since it is larger than the sum of its proper divisors (1).
242264069 is an equidigital number, since it uses as much as digits as its factorization.
242264069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 35.
The square root of 242264069 is about 15564.8343711072. The cubic root of 242264069 is about 623.3945518021.
The spelling of 242264069 in words is "two hundred forty-two million, two hundred sixty-four thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •