8176
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
- 4
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 18352
- Proper Divisor Sum (Aliquot Sum)
- 10176
- 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
- 3456
- Möbius Function
- 0
- Radical
- 1022
- 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
- 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
- a(n) = C(n+2,3) + C(n,3) + C(n-1,3).at n=25A006004
- Number of compositions (ordered partitions) of n into squares.at n=28A006456
- Stella octangula numbers: a(n) = n*(2*n^2 - 1).at n=16A007588
- a(n) = (2*n - 1)*(3*n + 1).at n=37A033569
- Numbers whose base-4 representation contains exactly two 0's and four 3's.at n=24A045075
- Number of 2n-bead balanced binary necklaces of fundamental period 2n which are equivalent to their reverse, complement and reversed complement.at n=27A045683
- Theta series of 14-dimensional lattice (SU(3,3) x C4).C2 with minimal norm 3.at n=6A047631
- Numbers m such that 2*phi(m) = phi(m+1).at n=14A050472
- Number of primitive (aperiodic) palindromic structures of length n using a maximum of two different symbols.at n=27A056476
- Number of primitive (aperiodic) palindromic structures using exactly two different symbols.at n=27A056481
- Number of primitive (period n) periodic palindromic structures using a maximum of two different symbols.at n=27A056513
- Number of primitive (period n) periodic palindromic structures using exactly two different symbols.at n=26A056518
- T(n,m) = (1/m!)*Sum_{i=0..m} stirling1(m,i)*(2^i)*(2^i+1)*...*(2^i+n-1).at n=25A059587
- a(n) is the number of distinct patterns (modulo geometric D3-operations) with strict median-reflective (palindrome) symmetry (i.e., having no other symmetry) which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.at n=25A060549
- a(n) = floor(X/Y) where X = concatenation in decreasing order of (2n)-th even number to (n+1)-th even number and Y = that of first n even numbers in increasing order.at n=4A067092
- Numbers k such that reverse(gpf(k)) = gpf(k+1), where gpf(n) = A006530(n); a(1)=1.at n=20A071844
- a(n) = 10*a(n-2) - 16*a(n-4) for n > 3, a(0) = 1, a(1) = 5, a(2) = 14, a(3) = 34.at n=8A083332
- a(n) = 2*A002532(n).at n=8A083694
- a(1) = 668; for n > 1, a(n) = a(n-1) + 1 + sum of distinct prime factors of a(n-1) that are < a(n-1).at n=28A105212
- Numbers k such that A109631(k) + A109631(k+1) = A109631(k+2).at n=8A109651