Base | Representation |
---|---|
bin | 110111010011100111110101… |
… | …001011111100110101100010 |
3 | 1011220020121112021010012112200 |
4 | 313103213311023330311202 |
5 | 223340230030041100213 |
6 | 2221155212055034030 |
7 | 102143403434424522 |
oct | 6723476513746542 |
9 | 1156217467105480 |
10 | 243240996425058 |
11 | 7055aa22225215 |
12 | 2334589966b916 |
13 | a5956b2012b88 |
14 | 440ccd9b41682 |
15 | 1d1c3cab83273 |
hex | dd39f52fcd62 |
243240996425058 has 24 divisors (see below), whose sum is σ = 554760167286000. Its totient is φ = 76812946239384.
The previous prime is 243240996425041. The next prime is 243240996425081. The reversal of 243240996425058 is 850524699042342.
243240996425058 is a `hidden beast` number, since 2 + 4 + 3 + 2 + 409 + 96 + 42 + 50 + 58 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 243240996424986 and 243240996425004.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 355615491508 + ... + 355615492191.
It is an arithmetic number, because the mean of its divisors is an integer number (23115006970250).
Almost surely, 2243240996425058 is an apocalyptic number.
243240996425058 is an abundant number, since it is smaller than the sum of its proper divisors (311519170860942).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
243240996425058 is a wasteful number, since it uses less digits than its factorization.
243240996425058 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 711230983726 (or 711230983723 counting only the distinct ones).
The product of its (nonzero) digits is 149299200, while the sum is 63.
The spelling of 243240996425058 in words is "two hundred forty-three trillion, two hundred forty billion, nine hundred ninety-six million, four hundred twenty-five thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •