Base | Representation |
---|---|
bin | 100101000001001… |
… | …1010001011101001 |
3 | 10012120022112022101 |
4 | 1022002122023221 |
5 | 10020442124023 |
6 | 323131253401 |
7 | 42532030330 |
oct | 11202321351 |
9 | 3176275271 |
10 | 1242145513 |
11 | 588182344 |
12 | 2a7baa261 |
13 | 16a45c75b |
14 | bad80d17 |
15 | 740b31ad |
hex | 4a09a2e9 |
1242145513 has 4 divisors (see below), whose sum is σ = 1419594880. Its totient is φ = 1064696148.
The previous prime is 1242145493. The next prime is 1242145517. The reversal of 1242145513 is 3155412421.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1242145513 - 221 = 1240048361 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1242145517) 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, 88724673 + ... + 88724686.
It is an arithmetic number, because the mean of its divisors is an integer number (354898720).
Almost surely, 21242145513 is an apocalyptic number.
It is an amenable number.
1242145513 is a deficient number, since it is larger than the sum of its proper divisors (177449367).
1242145513 is an equidigital number, since it uses as much as digits as its factorization.
1242145513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177449366.
The product of its digits is 4800, while the sum is 28.
The square root of 1242145513 is about 35244.0847944730. The cubic root of 1242145513 is about 1074.9563387351.
Adding to 1242145513 its reverse (3155412421), we get a palindrome (4397557934).
The spelling of 1242145513 in words is "one billion, two hundred forty-two million, one hundred forty-five thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •