17304
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 49920
- Proper Divisor Sum (Aliquot Sum)
- 32616
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4896
- Möbius Function
- 0
- Radical
- 4326
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- 141
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Number of permutations of length n with 3 consecutive ascending pairs.at n=8A000313
- a(n) = (5*n^2 + 1)*n^2 / 6.at n=12A008354
- Triangle read by rows: T(n,k) is the number of permutations of [n] having k consecutive ascending pairs (0 <= k <= n-1).at n=41A010027
- Triangle read by rows: T(n,k) = Sum_{j=0..k-1} T(n,j) + Sum_{j=1..n-k} T(n-j,k), with T(0,0)=1 and T(n,k) = 0 for k > n.at n=33A059450
- Triangle of Legendre-Stirling numbers of the second kind T(n,j), n >= 1, 1 <= j <= n, read by rows.at n=42A071951
- Diagonal T(n,n-2) of triangle in A071951.at n=6A071953
- Triangle read by rows: T(n,k) is the number of permutations of [n] having k small descents (n >= 1; 0 <= k <= n-1). A small descent in a permutation (x_1,x_2,...,x_n) is a position i such that x_i - x_(i+1) = 1.at n=39A123513
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having abscissa of the first return to the x-axis equal to 2k (1 <= k <= n).at n=50A129159
- Number of different walks generated by n steps that can only go in {east, southeast, southwest} directions on the 300-degree wedge in a 60-degree equilateral triangular lattice.at n=10A129703
- Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A130369/A130370.at n=6A130379
- Twice 12-gonal numbers: a(n) = 2*n*(5*n-4).at n=42A152965
- Number of permutations of length n within distance 5.at n=8A154654
- Number of 6X6 arrays of squares of integers, symmetric about both diagonal and antidiagonal, with all rows summing to n.at n=31A156389
- a(n) = 1728*n + 24.at n=9A157325
- Partial sums of A001676.at n=14A178579
- Triangle read by rows of Legendre-Stirling numbers of the second kind.at n=38A191935
- Number of (n+1) X 3 0..1 arrays with the number of rightwards and downwards edge increases in each 2 X 2 subblock equal to the number in all its horizontal and vertical neighbors.at n=43A206261
- Number of (w,x,y,z) with all terms in {1,...,n} and w^3<x^3+y^3+z^3.at n=12A212097
- Number of unrooted binary leaf-multi-labeled trees with n leaves on the label set [4], with each label used at least once.at n=7A220831
- The hyper-Wiener index of the cyclic phenylene with n hexagons (n>=3).at n=4A224457