Base | Representation |
---|---|
bin | 1001110001000100… |
… | …11000011101000001 |
3 | 111112102120121212111 |
4 | 10320202120131001 |
5 | 41214314120244 |
6 | 2224150255321 |
7 | 243640023661 |
oct | 47042303501 |
9 | 14472517774 |
10 | 5243504449 |
11 | 2250904557 |
12 | 1024057541 |
13 | 657438871 |
14 | 37a56a1a1 |
15 | 20a505e34 |
hex | 138898741 |
5243504449 has 4 divisors (see below), whose sum is σ = 5249652436. Its totient is φ = 5237356464.
The previous prime is 5243504447. The next prime is 5243504503. The reversal of 5243504449 is 9444053425.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1041223824 + 4202280625 = 32268^2 + 64825^2 .
It is a cyclic number.
It is not a de Polignac number, because 5243504449 - 21 = 5243504447 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5243504447) 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, 3072714 + ... + 3074419.
It is an arithmetic number, because the mean of its divisors is an integer number (1312413109).
Almost surely, 25243504449 is an apocalyptic number.
It is an amenable number.
5243504449 is a deficient number, since it is larger than the sum of its proper divisors (6147987).
5243504449 is an equidigital number, since it uses as much as digits as its factorization.
5243504449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6147986.
The product of its (nonzero) digits is 345600, while the sum is 40.
The square root of 5243504449 is about 72412.0462975602. The cubic root of 5243504449 is about 1737.2962422345.
The spelling of 5243504449 in words is "five billion, two hundred forty-three million, five hundred four thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •