Base | Representation |
---|---|
bin | 10011001111100100100001 |
3 | 100111021202211 |
4 | 103033210201 |
5 | 2242411023 |
6 | 300042121 |
7 | 60610015 |
oct | 23174441 |
9 | 10437684 |
10 | 5044513 |
11 | 2936021 |
12 | 1833341 |
13 | 1078126 |
14 | 954545 |
15 | 699a0d |
hex | 4cf921 |
5044513 has 2 divisors, whose sum is σ = 5044514. Its totient is φ = 5044512.
The previous prime is 5044511. The next prime is 5044531. The reversal of 5044513 is 3154405.
Together with next prime (5044531) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4255969 + 788544 = 2063^2 + 888^2 .
It is a cyclic number.
It is not a de Polignac number, because 5044513 - 21 = 5044511 is a prime.
It is a super-2 number, since 2×50445132 = 50894222814338, which contains 22 as substring.
Together with 5044511, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (5044511) 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, 2522256 + 2522257.
It is an arithmetic number, because the mean of its divisors is an integer number (2522257).
Almost surely, 25044513 is an apocalyptic number.
It is an amenable number.
5044513 is a deficient number, since it is larger than the sum of its proper divisors (1).
5044513 is an equidigital number, since it uses as much as digits as its factorization.
5044513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 22.
The square root of 5044513 is about 2245.9993321459. Note that the first 3 decimals coincide. The cubic root of 5044513 is about 171.5035372853.
Adding to 5044513 its reverse (3154405), we get a palindrome (8198918).
The spelling of 5044513 in words is "five million, forty-four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •