5171
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 5172
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5170
- Möbius Function
- -1
- Radical
- 5171
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 54
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 689
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 54.at n=26A020393
- n written in fractional base 9/5.at n=46A024653
- a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A003072.at n=23A024972
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 71.at n=12A031569
- Primes with first digit 5.at n=36A045711
- a(n) is the smallest prime factor of 1 + lcm(1..k) where k is the n-th prime power A000961(n).at n=24A051454
- Primes for which some rearrangement of the digits (leading zeros not allowed) is the product of two consecutive primes.at n=32A053652
- Run through primes p; if the digits of p*q (where q is the prime following p) can be rearranged to form one or more primes r, append these primes r to the sequence.at n=9A053736
- a(n+1) = smallest prime p in the range a(n) < p < a(1)*a(2)*...*a(n) such that p-1 divides a(1)*a(2)*...*a(n); or if no such prime p exists, then a(n+1) = smallest prime > a(n).at n=45A057459
- Primes p such that x^47 = 2 has no solution mod p.at n=16A059257
- Primes p such that p^12 reversed is also prime.at n=15A059705
- Primes p such that p^6 + p^3 + 1 is prime.at n=27A066100
- Conjectured values of first prime in the orbit f(m), f(f(m)), ..., where f(n) = A067599(n) and m = n-th composite number; or 0 if none exists.at n=22A066817
- Decimal encoding of the prime factorization of n: concatenation of prime factors and exponents.at n=33A067599
- a(1) = 11 by convention; for n > 1, if n = p^a*q^b... then a(n) = concatenate(p,a,q,b,...).at n=34A068633
- Expansion of (1-x-sqrt(1-2*x-3*x^2-4*x^3))/(2*x*(1+x)).at n=11A071359
- Triangle read by rows of numbers of paths in a lattice satisfying certain conditions.at n=35A071950
- Numerator of Sum_{k=1..n} frac(n/k), where frac(x/y) denotes the fractional part of x/y.at n=11A075710
- Final members of groups in A076034.at n=44A076033
- Primes in A087461.at n=42A087506