Base | Representation |
---|---|
bin | 110111000111011100010110… |
… | …010010110010100101001101 |
3 | 1011210021121011212020021202112 |
4 | 313013130112102302211031 |
5 | 223233021430002242334 |
6 | 2215314513041233405 |
7 | 102026053626651626 |
oct | 6707342622624515 |
9 | 1153247155207675 |
10 | 242404033243469 |
11 | 70267a78340069 |
12 | 2322b638332865 |
13 | a5347aa1b9b26 |
14 | 43c05bc67aa4d |
15 | 1d057427c24ce |
hex | dc77164b294d |
242404033243469 has 2 divisors, whose sum is σ = 242404033243470. Its totient is φ = 242404033243468.
The previous prime is 242404033243397. The next prime is 242404033243483. The reversal of 242404033243469 is 964342330404242.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 225816439296100 + 16587593947369 = 15027190^2 + 4072787^2 .
It is a cyclic number.
It is not a de Polignac number, because 242404033243469 - 212 = 242404033239373 is a prime.
It is a super-2 number, since 2×2424040332434692 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (242404039243469) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121202016621734 + 121202016621735.
It is an arithmetic number, because the mean of its divisors is an integer number (121202016621735).
Almost surely, 2242404033243469 is an apocalyptic number.
It is an amenable number.
242404033243469 is a deficient number, since it is larger than the sum of its proper divisors (1).
242404033243469 is an equidigital number, since it uses as much as digits as its factorization.
242404033243469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11943936, while the sum is 50.
The spelling of 242404033243469 in words is "two hundred forty-two trillion, four hundred four billion, thirty-three million, two hundred forty-three thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •