16722
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 36270
- Proper Divisor Sum (Aliquot Sum)
- 19548
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5568
- Möbius Function
- 0
- Radical
- 5574
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 115
- 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
- Coordination sequence for 9-dimensional cubic lattice.at n=5A008418
- Number of points of L1 norm 5 in cubic lattice Z^n.at n=9A035599
- Number of nodes in virtual, "optimal", chordal graphs of diameter 5, degree =n+1.at n=15A067969
- Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n that start with exactly k (0,1) steps (or, equivalently, with exactly k (1,0) steps).at n=49A110171
- McKay-Thompson series of class 24g for the Monster group.at n=55A112164
- Riordan array (1/(1-2x), x(1-x)/(1-2x)^2).at n=49A114164
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only either two adjacent vertically or two adjacent horizontally.at n=7A145776
- Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 3X3 plus 2,1 2,2 2,3 1,2 3,2.at n=11A146004
- Length of the n-th term in the modified Look and Say sequence A110393.at n=36A179999
- Number of (n+2)X3 binary arrays avoiding patterns 001 and 010 in rows, columns and nw-to-se diagonals.at n=5A202891
- Number of (n+2)X8 binary arrays avoiding patterns 001 and 010 in rows, columns and nw-to-se diagonals.at n=0A202896
- T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 010 in rows, columns and nw-to-se diagonals.at n=15A202898
- T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 010 in rows, columns and nw-to-se diagonals.at n=20A202898
- Years >= 1801 in which Christmas falls in Sukkot.at n=35A222419
- Triangle read by rows: T(n,k) is the coefficient A_k in the transformation Sum_{k=0..n} (k+1)*x^k = Sum_{k=0..n} A_k*(x+2)^k.at n=50A246788
- Number of n X 2 nonnegative integer arrays with upper left 0 and every value within 2 of its city block distance from the upper left and every value increasing by 0 or 1 with every step right or down.at n=22A252814
- Coordination sequence for (2,3,8) tiling of hyperbolic plane.at n=39A265058
- T(n,k) is the coordination number of the (n+1)-dimensional cubic lattice for radius k; triangle read by rows, n>=0, 0<=k<=n.at n=41A343599