Base | Representation |
---|---|
bin | 110111000010011110111100… |
… | …010111100100100101010000 |
3 | 1011202002000111010222221102021 |
4 | 313002132330113210211100 |
5 | 223211430434331143044 |
6 | 2214454150432301224 |
7 | 101662330205210200 |
oct | 6702367427444520 |
9 | 1152060433887367 |
10 | 242063222131024 |
11 | 70146488354a68 |
12 | 231955833a1814 |
13 | a50b605264a98 |
14 | 43abccb34c400 |
15 | 1ceb94730be84 |
hex | dc27bc5e4950 |
242063222131024 has 30 divisors (see below), whose sum is σ = 545568512126154. Its totient is φ = 103741380912960.
The previous prime is 242063222131019. The next prime is 242063222131123. The reversal of 242063222131024 is 420131222360242.
242063222131024 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 212527997155600 + 29535224975424 = 14578340^2 + 5434632^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 154377054147 + ... + 154377055714.
Almost surely, 2242063222131024 is an apocalyptic number.
It is an amenable number.
242063222131024 is an abundant number, since it is smaller than the sum of its proper divisors (303505289995130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
242063222131024 is a wasteful number, since it uses less digits than its factorization.
242063222131024 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 308754109883 (or 308754109870 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 34.
Adding to 242063222131024 its reverse (420131222360242), we get a palindrome (662194444491266).
The spelling of 242063222131024 in words is "two hundred forty-two trillion, sixty-three billion, two hundred twenty-two million, one hundred thirty-one thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •