Base | Representation |
---|---|
bin | 11100110111010… |
… | …00011011010111 |
3 | 121212121012101012 |
4 | 32123220123113 |
5 | 443440441003 |
6 | 40005322435 |
7 | 6000011225 |
oct | 1633503327 |
9 | 555535335 |
10 | 242124503 |
11 | 1147447a5 |
12 | 6910641b |
13 | 3b215b4a |
14 | 24229b15 |
15 | 163ca8d8 |
hex | e6e86d7 |
242124503 has 4 divisors (see below), whose sum is σ = 242186880. Its totient is φ = 242062128.
The previous prime is 242124499. The next prime is 242124521. The reversal of 242124503 is 305421242.
It is a happy number.
242124503 is an esthetic number in base 3, because in such base its adjacent digits differ by 1.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 242124503 - 22 = 242124499 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (242124563) 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 3 ways as a sum of consecutive naturals, for example, 24950 + ... + 33267.
It is an arithmetic number, because the mean of its divisors is an integer number (60546720).
Almost surely, 2242124503 is an apocalyptic number.
242124503 is a deficient number, since it is larger than the sum of its proper divisors (62377).
242124503 is an equidigital number, since it uses as much as digits as its factorization.
242124503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62376.
The product of its (nonzero) digits is 1920, while the sum is 23.
The square root of 242124503 is about 15560.3503495262. The cubic root of 242124503 is about 623.2748182716.
Adding to 242124503 its reverse (305421242), we get a palindrome (547545745).
The spelling of 242124503 in words is "two hundred forty-two million, one hundred twenty-four thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •