Base | Representation |
---|---|
bin | 1110000111011111111… |
… | …0100100100100110111 |
3 | 212012000101222101121201 |
4 | 3201313332210210313 |
5 | 12433200422410043 |
6 | 303230042153331 |
7 | 23344100665360 |
oct | 3416776444467 |
9 | 765011871551 |
10 | 242531060023 |
11 | 9394750808a |
12 | 3b0071b2847 |
13 | 19b41887495 |
14 | ba4a8a6b67 |
15 | 649726ec4d |
hex | 3877fa4937 |
242531060023 has 8 divisors (see below), whose sum is σ = 277186567040. Its totient is φ = 207877606200.
The previous prime is 242531060003. The next prime is 242531060039. The reversal of 242531060023 is 320060135242.
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 242531060023 - 213 = 242531051831 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 242531059973 and 242531060000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (242531060003) 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 7 ways as a sum of consecutive naturals, for example, 251253 + ... + 740398.
It is an arithmetic number, because the mean of its divisors is an integer number (34648320880).
Almost surely, 2242531060023 is an apocalyptic number.
242531060023 is a deficient number, since it is larger than the sum of its proper divisors (34655507017).
242531060023 is an equidigital number, since it uses as much as digits as its factorization.
242531060023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1026597.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 242531060023 its reverse (320060135242), we get a palindrome (562591195265).
The spelling of 242531060023 in words is "two hundred forty-two billion, five hundred thirty-one million, sixty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •