17844
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 41664
- Proper Divisor Sum (Aliquot Sum)
- 23820
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5944
- Möbius Function
- 0
- Radical
- 8922
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 97
- 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
- A089450 indexed by A000040.at n=12A089525
- Number of collinear point 8-tuples in an n X n X n cubical grid.at n=9A178266
- Number of 5 X n binary arrays without the pattern 0 1 diagonally, vertically, antidiagonally or horizontally.at n=18A188556
- Number of (n+1) X 3 0..2 arrays with every 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward and upward neighbors.at n=2A206662
- Number of (n+1) X 4 0..2 arrays with every 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward and upward neighbors.at n=1A206663
- T(n,k) = number of (n+1) X (k+1) 0..2 arrays with every 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward and upward neighbors.at n=7A206668
- T(n,k) = number of (n+1) X (k+1) 0..2 arrays with every 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward and upward neighbors.at n=8A206668
- Square array A(1,k) = A265907(k), A(n>1,k) = A(n-1, k+1) - A(n-1, k); successive differences of A265907 read by descending antidiagonals as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...at n=19A275960
- Transpose of array A275960.at n=16A275961
- Number A(n,k) of partitions of n with k sorts of part 1; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=73A292741
- Number of edges formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares).at n=12A331765
- Partial sums of A334136.at n=31A332264
- Positions of records in A351089.at n=19A349908
- Expansion of Product_{k>0} ((1 - q^(2*k))*(1 - q^(6*k))^3)/((1 - q^k)*(1 - q^(3*k))*(1 - q^(4*k))*(1 - q^(12*k))).at n=48A385520