Base | Representation |
---|---|
bin | 100101000001110… |
… | …0001001000011111 |
3 | 10012120212021221212 |
4 | 1022003201020133 |
5 | 10021030424002 |
6 | 323141415035 |
7 | 42534350522 |
oct | 11203411037 |
9 | 3176767855 |
10 | 1242436127 |
11 | 588360719 |
12 | 2a810a47b |
13 | 16a531b0a |
14 | bb018bb9 |
15 | 7411e352 |
hex | 4a0e121f |
1242436127 has 4 divisors (see below), whose sum is σ = 1243995816. Its totient is φ = 1240876440.
The previous prime is 1242436093. The next prime is 1242436147. The reversal of 1242436127 is 7216342421.
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 1242436127 - 230 = 168694303 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1242436093 and 1242436102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1242436147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 778649 + ... + 780242.
It is an arithmetic number, because the mean of its divisors is an integer number (310998954).
Almost surely, 21242436127 is an apocalyptic number.
1242436127 is a deficient number, since it is larger than the sum of its proper divisors (1559689).
1242436127 is an equidigital number, since it uses as much as digits as its factorization.
1242436127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1559688.
The product of its digits is 16128, while the sum is 32.
The square root of 1242436127 is about 35248.2074295985. The cubic root of 1242436127 is about 1075.0401649316.
Adding to 1242436127 its reverse (7216342421), we get a palindrome (8458778548).
The spelling of 1242436127 in words is "one billion, two hundred forty-two million, four hundred thirty-six thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •