8356
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 14630
- Proper Divisor Sum (Aliquot Sum)
- 6274
- 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
- 4176
- Möbius Function
- 0
- Radical
- 4178
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 65
- 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
- Numbers that are the sum of 11 positive 8th powers.at n=19A003389
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t = A002808 (composite numbers).at n=38A023863
- Row/column pre-periods of Sprague-Grundy values of Wythoff's Game.at n=38A046874
- a(0)=1, a(n) = 2*Fibonacci(n+4) - 6.at n=15A063758
- a(n) is the number of rotation-reflection inequivalent solutions to the all-ones lights out problem on an n X n square.at n=18A075463
- a(n) is the number of rotation-reflection inequivalent solutions to the all-ones lights out problem on an n X n square.at n=32A075463
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={-1,1,2}.at n=29A080000
- Number of terms in the simple continued fraction for the 10^n-th harmonic number, H_n = sum_{k=1 to n} (1/k).at n=4A091590
- Apply partial sum operator thrice to factorials.at n=10A152689
- T(n,k) = 1 + A176343(n) - A176343(k) - A176343(n-k), triangle read by rows (n >= 0, 0 <= k <= n).at n=30A176344
- T(n,k) = 1 + A176343(n) - A176343(k) - A176343(n-k), triangle read by rows (n >= 0, 0 <= k <= n).at n=33A176344
- a(n) is the number of distinct billiard words with length n on an alphabet of 4 symbols.at n=7A180239
- G.f. A(x) satisfies A(A(x)) = (x+2*x^2)/(1-2*x-4*x^2).at n=12A199823
- Number of 2 X 2 matrices with all terms in {0,1,...,n} and (sum of terms) = n + 4.at n=31A210376
- Number of partitions of n into exactly 5 different parts with distinct multiplicities.at n=23A212116
- Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..2 array extended with zeros and convolved with -1,2,-1.at n=16A222037
- Number of partitions p of n not containing ceiling((min(p) + max(p))/2) as a part.at n=33A238485
- Number of (n+1)X(6+1) arrays of permutations of 0..n*7+6 with each element having directed index change 1,0 1,1 0,-1 or -1,1.at n=3A264567
- T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 1,0 1,1 0,-1 or -1,1.at n=39A264569
- Number of (4+1)X(n+1) arrays of permutations of 0..n*5+4 with each element having directed index change 1,0 1,1 0,-1 or -1,1.at n=5A264572