3173
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
- 4
- Divisor Sum
- 3360
- Proper Divisor Sum (Aliquot Sum)
- 187
- 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
- 2988
- Möbius Function
- 1
- Radical
- 3173
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 79
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of graphical partitions of 2n.at n=15A000569
- Solid partitions of n which are restricted to two planes.at n=11A002835
- Numbers that are the sum of 9 positive 6th powers.at n=38A003365
- Number of strict 3rd-order maximal independent sets in cycle graph.at n=37A007392
- Coordination sequence T1 for Zeolite Code HEU.at n=37A008116
- Coordination sequence T6 for Zeolite Code MFI.at n=36A008169
- a(n) = floor(n(n-1)(n-2)(n-3)/18).at n=17A011928
- Fibonacci sequence beginning 1, 13.at n=13A022103
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...), t = (composite numbers).at n=21A024480
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...), t = (composite numbers).at n=20A025100
- Nonprime; becomes prime if any digit is deleted (zeros not allowed in the number).at n=41A034304
- Number of partitions of n such that cn(0,5) = cn(2,5) <= cn(1,5) = cn(3,5) = cn(4,5).at n=73A036855
- Number of partitions of n such that cn(0,5) = cn(2,5) < cn(1,5) = cn(3,5) = cn(4,5).at n=73A036857
- Least k such that A033178(k)=n.at n=31A038004
- Numerators of continued fraction convergents to sqrt(949).at n=6A042836
- Numbers n such that string 7,3 occurs in the base 10 representation of n but not of n-1.at n=34A044405
- Numbers n such that string 7,3 occurs in the base 10 representation of n but not of n+1.at n=34A044786
- Recip transform of 2*(1 + x^2 + x^4)-1/(1-x).at n=11A049153
- a(1) = 1; a(n) = smallest multiple of n-th prime (n>1) with all odd digits.at n=38A062280
- Numbers k such that 10*k-1, 10*k-3, 10*k-7 and 10*k-9 are all prime.at n=21A064975