Base | Representation |
---|---|
bin | 10011010111010001101101 |
3 | 100112220001212 |
4 | 103113101231 |
5 | 2244413302 |
6 | 300444205 |
7 | 61101026 |
oct | 23272155 |
9 | 10486055 |
10 | 5076077 |
11 | 2957806 |
12 | 1849665 |
13 | 10895c6 |
14 | 961c4d |
15 | 6a4052 |
hex | 4d746d |
5076077 has 4 divisors (see below), whose sum is σ = 5296800. Its totient is φ = 4855356.
The previous prime is 5076053. The next prime is 5076083. The reversal of 5076077 is 7706705.
It is a happy number.
5076077 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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, and also an emirpimes, since its reverse is a distinct semiprime: 7706705 = 5 ⋅1541341.
It is a cyclic number.
It is not a de Polignac number, because 5076077 - 28 = 5075821 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5076017) 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, 110327 + ... + 110372.
It is an arithmetic number, because the mean of its divisors is an integer number (1324200).
Almost surely, 25076077 is an apocalyptic number.
It is an amenable number.
5076077 is a deficient number, since it is larger than the sum of its proper divisors (220723).
5076077 is a wasteful number, since it uses less digits than its factorization.
5076077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220722.
The product of its (nonzero) digits is 10290, while the sum is 32.
The square root of 5076077 is about 2253.0150909393. The cubic root of 5076077 is about 171.8604984790.
The spelling of 5076077 in words is "five million, seventy-six thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •