Base | Representation |
---|---|
bin | 10011101110100001111001 |
3 | 100201201201102 |
4 | 103232201321 |
5 | 2310440241 |
6 | 302501145 |
7 | 61645511 |
oct | 23564171 |
9 | 10651642 |
10 | 5171321 |
11 | 2a12321 |
12 | 18947b5 |
13 | 10c0a6c |
14 | 988841 |
15 | 6c239b |
hex | 4ee879 |
5171321 has 4 divisors (see below), whose sum is σ = 5221632. Its totient is φ = 5121012.
The previous prime is 5171317. The next prime is 5171323. The reversal of 5171321 is 1231715.
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: 1231715 = 5 ⋅246343.
It is a cyclic number.
It is not a de Polignac number, because 5171321 - 22 = 5171317 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a nialpdrome in base 14.
It is a junction number, because it is equal to n+sod(n) for n = 5171293 and 5171302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5171323) 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, 25001 + ... + 25206.
It is an arithmetic number, because the mean of its divisors is an integer number (1305408).
Almost surely, 25171321 is an apocalyptic number.
It is an amenable number.
5171321 is a deficient number, since it is larger than the sum of its proper divisors (50311).
5171321 is a wasteful number, since it uses less digits than its factorization.
5171321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50310.
The product of its digits is 210, while the sum is 20.
The square root of 5171321 is about 2274.0538691948. The cubic root of 5171321 is about 172.9287353909.
The spelling of 5171321 in words is "five million, one hundred seventy-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •