16752
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 43400
- Proper Divisor Sum (Aliquot Sum)
- 26648
- 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
- 2094
- Omega Function (Ω)
- 6
- 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
- 128
- 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
- a(n) = n!*Sum_{i=0..n-1} (n-i)*(-2)^i/(i+1)!.at n=7A037256
- Growth function of an infinite cubic graph (number of nodes at distance <=n from fixed node).at n=33A038621
- The number k(GL(n,q)) of conjugacy classes in GL(n,q), q=7.at n=5A049316
- Number of objects generated by the Combstruct grammar defined in the Maple program. See the link for the grammar specification.at n=9A052815
- Di-Boustrophedon transform of all 1's sequence: Fill in an array by diagonals alternating in the 'up' and 'down' directions. Each diagonal starts with a 1. When going in the 'up' direction the next element is the sum of the previous element of the diagonal and the previous two elements of the row the new element is in. When going in the 'down' direction the next element is the sum of the previous element of the diagonal and the previous two elements of the column the new element is in. The final element of the n-th diagonal is a(n).at n=8A062704
- Array described in A062704 read by diagonals in direction of creation.at n=44A062705
- The array of A062704 read by diagonals in the 'up' direction.at n=36A062706
- Triangle T, read by rows, that satisfies: T(n,k) = [T^2](n-1,k) for n>k+1>=1, with T(n,n) = 1 and T(n+1,n) = n+1 for n>=0, where T^2 is the matrix square of T.at n=47A109152
- Column 2 of triangle A109152.at n=7A109155
- a(n) = sum of squares of first n odd primes.at n=15A133547
- Number of nXnXn triangular 0..7 arrays with no element lying outside the (possibly reversed) range delimited by its sw and se neighbors, and every horizontal row having the same average value.at n=3A214539
- T(n,k)=Number of nXnXn triangular 0..k arrays with no element lying outside the (possibly reversed) range delimited by its sw and se neighbors, and every horizontal row having the same average value.at n=48A214540
- Number of 4X4X4 triangular 0..n arrays with no element lying outside the (possibly reversed) range delimited by its sw and se neighbors, and every horizontal row having the same average value.at n=6A214542
- Number of n-node unlabeled rooted trees with thickening limbs and root outdegree (branching factor) 6.at n=45A245146
- a(n) = 9*n^2 + 21*n - 6 (n>=1).at n=41A304374
- Number of length n primitive (=aperiodic or period n) 7-ary words which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet.at n=5A320072
- G.f.: (1 + x) * (1 + x^2) * (1 + x^3) * Product_{k>=1} (1 + x^k).at n=48A329384