Base | Representation |
---|---|
bin | 1110000101100111001… |
… | …1011001010100100101 |
3 | 212010201010101102102212 |
4 | 3201121303121110211 |
5 | 12431131323020421 |
6 | 303103515413205 |
7 | 23325412655135 |
oct | 3413163312445 |
9 | 763633342385 |
10 | 242024813861 |
11 | 93707774926 |
12 | 3aaa5754205 |
13 | 19a90a2633c |
14 | b9dd566ac5 |
15 | 6467ac0e5b |
hex | 3859cd9525 |
242024813861 has 2 divisors, whose sum is σ = 242024813862. Its totient is φ = 242024813860.
The previous prime is 242024813831. The next prime is 242024813951. The reversal of 242024813861 is 168318420242.
It is a happy number.
242024813861 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 150781549636 + 91243264225 = 388306^2 + 302065^2 .
It is a cyclic number.
It is not a de Polignac number, because 242024813861 - 214 = 242024797477 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (242024813831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121012406930 + 121012406931.
It is an arithmetic number, because the mean of its divisors is an integer number (121012406931).
Almost surely, 2242024813861 is an apocalyptic number.
It is an amenable number.
242024813861 is a deficient number, since it is larger than the sum of its proper divisors (1).
242024813861 is an equidigital number, since it uses as much as digits as its factorization.
242024813861 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 147456, while the sum is 41.
The spelling of 242024813861 in words is "two hundred forty-two billion, twenty-four million, eight hundred thirteen thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •