Base | Representation |
---|---|
bin | 11100111000101… |
… | …01010001101110 |
3 | 121212221112101000 |
4 | 32130111101232 |
5 | 444012330311 |
6 | 40013301130 |
7 | 6001404630 |
oct | 1634252156 |
9 | 555845330 |
10 | 242308206 |
11 | 11485a818 |
12 | 691947a6 |
13 | 3b27b64a |
14 | 24276a50 |
15 | 16415056 |
hex | e71546e |
242308206 has 64 divisors (see below), whose sum is σ = 617932800. Its totient is φ = 68944608.
The previous prime is 242308193. The next prime is 242308207. The reversal of 242308206 is 602803242.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 242308206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (242308207) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 100491 + ... + 102873.
It is an arithmetic number, because the mean of its divisors is an integer number (9655200).
Almost surely, 2242308206 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 242308206, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (308966400).
242308206 is an abundant number, since it is smaller than the sum of its proper divisors (375624594).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
242308206 is a wasteful number, since it uses less digits than its factorization.
242308206 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2670 (or 2664 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
The square root of 242308206 is about 15566.2521500842. The cubic root of 242308206 is about 623.4324073189.
The spelling of 242308206 in words is "two hundred forty-two million, three hundred eight thousand, two hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •