Base | Representation |
---|---|
bin | 10011101100110011101101 |
3 | 100201101001020 |
4 | 103230303231 |
5 | 2310224034 |
6 | 302404353 |
7 | 61616115 |
oct | 23546355 |
9 | 10641036 |
10 | 5164269 |
11 | 2a07aa0 |
12 | 18906b9 |
13 | 10ba7a6 |
14 | 986045 |
15 | 6c0249 |
hex | 4ecced |
5164269 has 8 divisors (see below), whose sum is σ = 7511712. Its totient is φ = 3129840.
The previous prime is 5164261. The next prime is 5164273. The reversal of 5164269 is 9624615.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5164269 - 23 = 5164261 is a prime.
It is a super-2 number, since 2×51642692 = 53339348608722, which contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 156493 = 5164269 / (5 + 1 + 6 + 4 + 2 + 6 + 9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5164261) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 78214 + ... + 78279.
It is an arithmetic number, because the mean of its divisors is an integer number (938964).
Almost surely, 25164269 is an apocalyptic number.
It is an amenable number.
5164269 is a deficient number, since it is larger than the sum of its proper divisors (2347443).
5164269 is a wasteful number, since it uses less digits than its factorization.
5164269 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156507.
The product of its digits is 12960, while the sum is 33.
The square root of 5164269 is about 2272.5028052788. The cubic root of 5164269 is about 172.8500934480.
The spelling of 5164269 in words is "five million, one hundred sixty-four thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •