Base | Representation |
---|---|
bin | 10011001110010101001001 |
3 | 100111000210200 |
4 | 103032111021 |
5 | 2242230213 |
6 | 300002413 |
7 | 60556140 |
oct | 23162511 |
9 | 10430720 |
10 | 5039433 |
11 | 2932223 |
12 | 1830409 |
13 | 1075a19 |
14 | 952757 |
15 | 698273 |
hex | 4ce549 |
5039433 has 24 divisors (see below), whose sum is σ = 8526336. Its totient is φ = 2808000.
The previous prime is 5039407. The next prime is 5039459. The reversal of 5039433 is 3349305.
It is an interprime number because it is at equal distance from previous prime (5039407) and next prime (5039459).
It is not a de Polignac number, because 5039433 - 29 = 5038921 is a prime.
It is a super-2 number, since 2×50394332 = 50791769922978, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5039397 and 5039406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5039933) 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 in 23 ways as a sum of consecutive naturals, for example, 1608 + ... + 3558.
It is an arithmetic number, because the mean of its divisors is an integer number (355264).
Almost surely, 25039433 is an apocalyptic number.
It is an amenable number.
5039433 is a deficient number, since it is larger than the sum of its proper divisors (3486903).
5039433 is a wasteful number, since it uses less digits than its factorization.
5039433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2005 (or 2002 counting only the distinct ones).
The product of its (nonzero) digits is 4860, while the sum is 27.
The square root of 5039433 is about 2244.8681475757. The cubic root of 5039433 is about 171.4459479410.
The spelling of 5039433 in words is "five million, thirty-nine thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •