Base | Representation |
---|---|
bin | 110111000110000011011101… |
… | …110000111100100110010000 |
3 | 1011202221110211122101222211010 |
4 | 313012003131300330212100 |
5 | 223224441000431120432 |
6 | 2215203010532450520 |
7 | 102016134612046113 |
oct | 6706033560744620 |
9 | 1152843748358733 |
10 | 242308595566992 |
11 | 70230553253179 |
12 | 23215042479a40 |
13 | a5287aa965606 |
14 | 43b9b2750a57a |
15 | 1d03008d873cc |
hex | dc60ddc3c990 |
242308595566992 has 80 divisors (see below), whose sum is σ = 628143654983040. Its totient is φ = 80488307613696.
The previous prime is 242308595566981. The next prime is 242308595566993. The reversal of 242308595566992 is 299665595803242.
It is a super-2 number, since 2×2423085955669922 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (242308595566993) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 205548309 + ... + 206723787.
It is an arithmetic number, because the mean of its divisors is an integer number (7851795687288).
Almost surely, 2242308595566992 is an apocalyptic number.
It is an amenable number.
242308595566992 is an abundant number, since it is smaller than the sum of its proper divisors (385835059416048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
242308595566992 is a wasteful number, since it uses less digits than its factorization.
242308595566992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1190440 (or 1190434 counting only the distinct ones).
The product of its (nonzero) digits is 2519424000, while the sum is 75.
The spelling of 242308595566992 in words is "two hundred forty-two trillion, three hundred eight billion, five hundred ninety-five million, five hundred sixty-six thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.341 sec. • engine limits •