8368
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 16244
- Proper Divisor Sum (Aliquot Sum)
- 7876
- 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
- 1046
- Omega Function (Ω)
- 5
- 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
- 127
- 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
- Susceptibility series H_2 for 2-dimensional Ising model (divided by 2).at n=39A054275
- Number of lattice congruences of the weak order on the Coxeter group B_n.at n=3A091688
- Numbers k such that 3^k mod k = 3^k mod k^2.at n=22A125774
- Number of compositions of n such that the cardinality of the set of parts is 2.at n=18A131661
- Total number of Fibonacci parts in all partitions of n.at n=22A144115
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = k if k <= floor(n/2) otherwise n-k, and m = 3, read by rows.at n=17A157209
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = k if k <= floor(n/2) otherwise n-k, and m = 3, read by rows.at n=18A157209
- Total number of possible standard knight moves on an n X 2n chessboard, if the knight is placed anywhere.at n=23A180319
- Number of n X 2 0..3 arrays with every element equal to either the sum mod 4 of its vertical neighbors or the sum mod 4 of its horizontal neighbors.at n=5A183485
- Number of nX6 0..3 arrays with every element equal to either the sum mod 4 of its vertical neighbors or the sum mod 4 of its horizontal neighbors.at n=1A183489
- T(n,k)=Number of nXk 0..3 arrays with every element equal to either the sum mod 4 of its vertical neighbors or the sum mod 4 of its horizontal neighbors.at n=22A183492
- T(n,k)=Number of nXk 0..3 arrays with every element equal to either the sum mod 4 of its vertical neighbors or the sum mod 4 of its horizontal neighbors.at n=26A183492
- Number of nondecreasing arrangements of 9 numbers in 0..n with the last equal to n and each after the second equal to the sum of one or two of the preceding four.at n=39A189332
- Number of (n+2)X(n+2) 0..1 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..1 introduced in row major order.at n=15A204746
- Number of (w,x,y,z) with all terms in {1,...,n} and w^3<x^3+y^3+z^3.at n=10A212097
- Triangle T(n,k) of the numbers of nodes in all non-extendable (complete) non-self-adjacent simple paths within a square lattice bounded by rectangles with nodal dimensions n and k, n >= k >= 2.at n=11A214397
- a(n) = 2^n mod 10000.at n=35A216095
- Numbers n such that n^2 + 1 and (n+1)^2 + 1 are divisible by a square.at n=36A217798
- Number of partitions p of n such that (number of even numbers in p) is a part of p.at n=34A241544
- Numbers k such that k+s+c is a square, where s is the nearest square to k and c is the nearest cube to k.at n=50A269569