Base | Representation |
---|---|
bin | 11100111000110… |
… | …10101011011011 |
3 | 121212222122201110 |
4 | 32130122223123 |
5 | 444014032311 |
6 | 40013551403 |
7 | 6001526265 |
oct | 1634325333 |
9 | 555878643 |
10 | 242330331 |
11 | 114875401 |
12 | 691a5563 |
13 | 3b288739 |
14 | 24280b35 |
15 | 1641b8a6 |
hex | e71aadb |
242330331 has 8 divisors (see below), whose sum is σ = 323338320. Its totient is φ = 161437952.
The previous prime is 242330329. The next prime is 242330339. The reversal of 242330331 is 133033242.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 242330331 - 21 = 242330329 is a prime.
It is a super-2 number, since 2×2423303312 = 117447978645139122, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 242330298 and 242330307.
It is not an unprimeable number, because it can be changed into a prime (242330339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23886 + ... + 32483.
It is an arithmetic number, because the mean of its divisors is an integer number (40417290).
Almost surely, 2242330331 is an apocalyptic number.
242330331 is a deficient number, since it is larger than the sum of its proper divisors (81007989).
242330331 is a wasteful number, since it uses less digits than its factorization.
242330331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57805.
The product of its (nonzero) digits is 1296, while the sum is 21.
The square root of 242330331 is about 15566.9628058912. The cubic root of 242330331 is about 623.4513818066.
Adding to 242330331 its reverse (133033242), we get a palindrome (375363573).
The spelling of 242330331 in words is "two hundred forty-two million, three hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •