Base | Representation |
---|---|
bin | 1000011010000000… |
… | …10011010001100001 |
3 | 102122112021202222112 |
4 | 10031000103101201 |
5 | 33220331300144 |
6 | 2023500245105 |
7 | 216561066602 |
oct | 41500232141 |
9 | 12575252875 |
10 | 4513150049 |
11 | 1a06612481 |
12 | a5b540795 |
13 | 56c02c0b5 |
14 | 30b56dda9 |
15 | 1b633999e |
hex | 10d013461 |
4513150049 has 2 divisors, whose sum is σ = 4513150050. Its totient is φ = 4513150048.
The previous prime is 4513150013. The next prime is 4513150051. The reversal of 4513150049 is 9400513154.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4480294225 + 32855824 = 66935^2 + 5732^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4513150049 is a prime.
Together with 4513150051, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 4513149997 and 4513150024.
It is not a weakly prime, because it can be changed into another prime (4513150249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2256575024 + 2256575025.
It is an arithmetic number, because the mean of its divisors is an integer number (2256575025).
Almost surely, 24513150049 is an apocalyptic number.
It is an amenable number.
4513150049 is a deficient number, since it is larger than the sum of its proper divisors (1).
4513150049 is an equidigital number, since it uses as much as digits as its factorization.
4513150049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 32.
The square root of 4513150049 is about 67179.9825022305. The cubic root of 4513150049 is about 1652.5702273622.
The spelling of 4513150049 in words is "four billion, five hundred thirteen million, one hundred fifty thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •