Base | Representation |
---|---|
bin | 10011010111010100101101 |
3 | 100112220022222 |
4 | 103113110231 |
5 | 2244420034 |
6 | 300445125 |
7 | 61101422 |
oct | 23272455 |
9 | 10486288 |
10 | 5076269 |
11 | 2957970 |
12 | 18497a5 |
13 | 1089713 |
14 | 961d49 |
15 | 6a412e |
hex | 4d752d |
5076269 has 4 divisors (see below), whose sum is σ = 5537760. Its totient is φ = 4614780.
The previous prime is 5076241. The next prime is 5076283. The reversal of 5076269 is 9626705.
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.
It is a cyclic number.
It is not a de Polignac number, because 5076269 - 212 = 5072173 is a prime.
It is a super-2 number, since 2×50762692 = 51537013920722, which contains 22 as substring.
It is an Ulam number.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5076209) 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, 230729 + ... + 230750.
It is an arithmetic number, because the mean of its divisors is an integer number (1384440).
Almost surely, 25076269 is an apocalyptic number.
It is an amenable number.
5076269 is a deficient number, since it is larger than the sum of its proper divisors (461491).
5076269 is a wasteful number, since it uses less digits than its factorization.
5076269 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 461490.
The product of its (nonzero) digits is 22680, while the sum is 35.
The square root of 5076269 is about 2253.0577001045. The cubic root of 5076269 is about 171.8626652966.
It can be divided in two parts, 507 and 6269, that added together give a palindrome (6776).
The spelling of 5076269 in words is "five million, seventy-six thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •