Base | Representation |
---|---|
bin | 11100110111100… |
… | …01101110001000 |
3 | 121212200010121000 |
4 | 32123301232020 |
5 | 443443200233 |
6 | 40010215000 |
7 | 6000230214 |
oct | 1633615610 |
9 | 555603530 |
10 | 242162568 |
11 | 11477035a |
12 | 69124460 |
13 | 3b22a27b |
14 | 24239944 |
15 | 163d6d13 |
hex | e6f1b88 |
242162568 has 64 divisors (see below), whose sum is σ = 674524800. Its totient is φ = 80498880.
The previous prime is 242162563. The next prime is 242162593. The reversal of 242162568 is 865261242.
It is a happy number.
242162568 is a `hidden beast` number, since 2 + 4 + 21 + 625 + 6 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (242162563) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 89605 + ... + 92267.
It is an arithmetic number, because the mean of its divisors is an integer number (10539450).
Almost surely, 2242162568 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 242162568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (337262400).
242162568 is an abundant number, since it is smaller than the sum of its proper divisors (432362232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
242162568 is a wasteful number, since it uses less digits than its factorization.
242162568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3099 (or 3089 counting only the distinct ones).
The product of its digits is 46080, while the sum is 36.
The square root of 242162568 is about 15561.5734422969. The cubic root of 242162568 is about 623.3074787590.
The spelling of 242162568 in words is "two hundred forty-two million, one hundred sixty-two thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •