9932
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 18816
- Proper Divisor Sum (Aliquot Sum)
- 8884
- 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
- 4560
- Möbius Function
- 0
- Radical
- 4966
- 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
- 42
- 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 lines through exactly 5 points of an n X n grid of points.at n=43A018812
- (d(n)-r(n))/5, where d = A006527 and r is the periodic sequence with fundamental period (4,1,4,0,1).at n=51A026036
- a(n) = floor(n^3 / e).at n=30A032636
- Numbers having three 5's in base 9.at n=36A043475
- Number of partitions of 2n in which all odd parts occur with multiplicity 2. There is no restriction on the even parts.at n=25A101277
- Numbers n such that P(13*n) is prime, where P(n) is the unrestricted partition number.at n=12A113518
- Total counts of distinct (directed) Hamiltonian cycles for all simple graphs of order n.at n=6A124964
- 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, 1, -1), (0, 1, 1), (1, -1, -1)}.at n=11A148049
- T(n,k)=Number of n-step one space for components leftwards or up, two space for components rightwards or down asymmetric quasi-queen's tours (antidiagonal moves become knight moves) on a kXk board summed over all starting positions.at n=41A187857
- Number of 6-step one space for components leftwards or up, two space for components rightwards or down asymmetric quasi-queen's tours (antidiagonal moves become knight moves) on an n X n board summed over all starting positions.at n=3A187861
- The number of complete binary trees with bicolored twigs. A twig is a vertex with one child on the boundary and the other child having no descendants.at n=8A228404
- Number of (n+1)X(1+1) 0..2 arrays x(i,j) with row sums sum{j^3*x(i,j), j=1..1+1} nondecreasing, and column sums sum{i^3*x(i,j), i=1..n+1} nondecreasing.at n=6A232784
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays x(i,j) with row sums sum{j^3*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^3*x(i,j), i=1..n+1} nondecreasing.at n=21A232787
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays x(i,j) with row sums sum{j^3*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^3*x(i,j), i=1..n+1} nondecreasing.at n=27A232787
- Triangle of numbers related to Catalan numbers (A000108).at n=57A237124
- Number of partitions p of n such that (number of numbers in p of form 3k+1) > (number of numbers in p of form 3k+2).at n=37A241739
- Number of (n+2) X (7+2) 0..1 arrays with no 3 x 3 subblock diagonal sum 1 and no antidiagonal sum 2 and no row sum 0 and no column sum 3.at n=33A255800
- Expansion of Product_{k>=1} (1+x^k)^(k*(k+1)*(k+2)/6).at n=10A258343
- Numbers k such that (35*10^k - 11)/3 is prime.at n=27A268448
- Alternating sum of 10-gonal (or decagonal) pyramidal numbers.at n=24A269441