Base | Representation |
---|---|
bin | 11100110111101… |
… | …11001001001101 |
3 | 121212201021001201 |
4 | 32123313021031 |
5 | 443444403111 |
6 | 40010505501 |
7 | 6000352036 |
oct | 1633671115 |
9 | 555637051 |
10 | 242184781 |
11 | 114786013 |
12 | 69135291 |
13 | 3b237407 |
14 | 24243a8d |
15 | 163dd6c1 |
hex | e6f724d |
242184781 has 2 divisors, whose sum is σ = 242184782. Its totient is φ = 242184780.
The previous prime is 242184751. The next prime is 242184821. The reversal of 242184781 is 187481242.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 238980681 + 3204100 = 15459^2 + 1790^2 .
It is a cyclic number.
It is not a de Polignac number, because 242184781 - 29 = 242184269 is a prime.
It is a super-2 number, since 2×2421847812 = 117306936296035922, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 242184781.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (242184731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121092390 + 121092391.
It is an arithmetic number, because the mean of its divisors is an integer number (121092391).
Almost surely, 2242184781 is an apocalyptic number.
It is an amenable number.
242184781 is a deficient number, since it is larger than the sum of its proper divisors (1).
242184781 is an equidigital number, since it uses as much as digits as its factorization.
242184781 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 28672, while the sum is 37.
The square root of 242184781 is about 15562.2871391065. The cubic root of 242184781 is about 623.3265363502.
The spelling of 242184781 in words is "two hundred forty-two million, one hundred eighty-four thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •