Base | Representation |
---|---|
bin | 11100110110011… |
… | …01000100001101 |
3 | 121212101111122022 |
4 | 32123031010031 |
5 | 443423344204 |
6 | 40003055525 |
7 | 5666033411 |
oct | 1633150415 |
9 | 555344568 |
10 | 242012429 |
11 | 11467857a |
12 | 690715a5 |
13 | 3b1a6b29 |
14 | 241dad41 |
15 | 163a75be |
hex | e6cd10d |
242012429 has 2 divisors, whose sum is σ = 242012430. Its totient is φ = 242012428.
The previous prime is 242012423. The next prime is 242012431. The reversal of 242012429 is 924210242.
It is a happy number.
242012429 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 227557225 + 14455204 = 15085^2 + 3802^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-242012429 is a prime.
Together with 242012431, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 242012398 and 242012407.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (242012423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121006214 + 121006215.
It is an arithmetic number, because the mean of its divisors is an integer number (121006215).
Almost surely, 2242012429 is an apocalyptic number.
It is an amenable number.
242012429 is a deficient number, since it is larger than the sum of its proper divisors (1).
242012429 is an equidigital number, since it uses as much as digits as its factorization.
242012429 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2304, while the sum is 26.
The square root of 242012429 is about 15556.7486641650. The cubic root of 242012429 is about 623.1786367870.
The spelling of 242012429 in words is "two hundred forty-two million, twelve thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •