8173
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8928
- Proper Divisor Sum (Aliquot Sum)
- 755
- 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
- 7420
- Möbius Function
- 1
- Radical
- 8173
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 158
- 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
- Reverse digits of number of partitions of n.at n=28A004089
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/26 ).at n=23A011936
- Expansion of 1/(1-x^2-x^3-x^4-x^5-x^6-x^7).at n=22A013984
- Powers of fifth root of 3 rounded down.at n=41A018120
- Powers of fifth root of 3 rounded to nearest integer.at n=41A018121
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MFS = ZSM-57 H1.5[Al1.5Si34.5O72] starting with a T2 atom.at n=12A019176
- a(n) = A082613(n) divided by the n-th power that divides it.at n=19A082614
- a(n) = number of partitions of n wherein the sum of the 1's is no more than the sum of the other parts.at n=31A083690
- Numbers n for which there are exactly five k such that n = k + (product of nonzero digits of k).at n=20A096926
- a(n) = a(n-2) + a(n-3) + a(n-4) + a(n-5) + a(n-6) + a(n-7).at n=21A107479
- Numbers k such that the concatenation of n successive descending digits (1,0,9,8,7,...) starting with 1 is prime.at n=10A120828
- Number of combinations which can be taken from the integer partitions of n. Total number of cases in the (n,m)-fragmentation process.at n=17A122768
- Let M be the matrix defined in A111490. Sequence gives the sum of the elements of the submatrices (from the upper left element): M(1,1); M(1,1)+M(1,2)+M(1,2)+M(2,2); M(1,1)+M(1,2)+M(1,3)+M(2,1)+M(2,2)+M(2,3)+M(3,1)+M(3,2)+M(3,3), etc.at n=31A123326
- Number of runs in all Fibonacci binary words of length n. A Fibonacci binary word is a binary word having no 00 subword. A run is a maximal sequence of consecutive identical letters.at n=14A129715
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (-1, 0, 0), (0, -1, -1), (1, 1, 1)}.at n=8A149507
- Number of nondecreasing arrangements of 4 numbers in -(n+2)..(n+2) with sum zero.at n=29A188212
- Number of nondecreasing arrangements of 9 numbers in 0..n with the last equal to n and each after the second equal to the sum of one or two of the preceding four.at n=35A189332
- Inverse permutation to A190130.at n=38A190131
- Number of 4-element subsets that can be chosen from {1,2,...,4*n} having element sum 8*n+2.at n=17A204468
- Number of n X 4 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=8A207107