8178
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 9102
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2576
- Möbius Function
- 1
- Radical
- 8178
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- 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
- Eulerian numbers (Euler's triangle: column k=2 of A008292, column k=1 of A173018).at n=13A000295
- Numbers k such that 6!*(2*k-7)!/(k!*(k-1)!) is an integer.at n=8A004786
- Numbers k such that 7!*(2k-8)!/(k!*(k-1)!) is an integer.at n=9A004787
- Triangular array formed from elements to right of middle of rows of the triangle of Eulerian numbers that are greater than 1.at n=29A014468
- Triangular array formed from even elements to right of middle of rows of the triangle of Eulerian numbers.at n=17A014472
- Distinct elements occurring in triangle of Eulerian numbers (unsorted).at n=31A014630
- n is equal to the number of 1's in all numbers <= n written in base 8.at n=2A014885
- Number of 2's in n-th term of A022470.at n=35A022473
- Euler transform of {1, primes}.at n=13A030012
- Distinct elements occurring in triangle of Eulerian numbers (sorted).at n=16A030196
- Otto Haxel's guess for magic numbers of nuclear shells.at n=29A033547
- Denominators of continued fraction convergents to sqrt(656).at n=12A042261
- Starting from generation 8 add previous and next term yielding generation 9.at n=10A048455
- Triangle T(n,k) giving number of rooted maps regardless of genus with n edges and k nodes (n >= 0, k = 1..n+1).at n=25A053979
- a(n) = 2^n - A056045(n).at n=12A056200
- a(n) = a(n-1) + floor(a(n-2)/2) with a(0)=1, a(1)=2.at n=29A064324
- Numbers k such that A000984(k) mod k = 0 and A080383(k) != 7.at n=36A080392
- Symmetric square table of coefficients, read by antidiagonals, where T(n,k) is the coefficient of x^n*y^k in f(x,y) that satisfies f(x,y) = (1-xy)/[(1-x)(1-y)] + xy*f(x,y)^3.at n=61A086626
- Symmetric square table of coefficients, read by antidiagonals, where T(n,k) is the coefficient of x^n*y^k in f(x,y) that satisfies f(x,y) = (1-xy)/[(1-x)(1-y)] + xy*f(x,y)^3.at n=59A086626
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n, having k long ascents (i.e., ascents of length at least 2). Rows are of length 1,1,2,2,3,3,... .at n=50A091156