8264
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15510
- Proper Divisor Sum (Aliquot Sum)
- 7246
- 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
- 4128
- Möbius Function
- 0
- Radical
- 2066
- Omega Function (Ω)
- 4
- 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
- 158
- 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
- Least positive unitary linear combination of distinct numbers in row n of Pascal's triangle; i.e., least positive sum of form d(0)C(n-1,0) + d(1)C(n-1,1) + ...+ d(m)C(n-1,m), d(i)=+-1, m = floor((n+1)/2).at n=29A004795
- Series for first parallel moment of square lattice.at n=12A006732
- Numbers whose base-4 representation contains exactly four 0's and two 2's.at n=33A045059
- Number of 2n-bead balanced binary necklaces which are equivalent to their reverse, complement and reversed complement.at n=28A045674
- a(1) = 1, a(n+1) is the smallest number such that there are n primes between a(n) and a(n+1) exclusive.at n=45A075342
- Even numbers n such that n^2 is an arithmetic number.at n=34A107924
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 0), (-1, 0, 1), (1, -1, 0), (1, 1, 0)}.at n=8A149271
- Successive powers of two, represented as binary coded decimal. (0x1, 0x2, 0x4, 0x8, 0x16, 0x32, etc.)at n=11A158324
- Triangle read by rows: coefficients of rook polynomials.at n=40A259985
- Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 453", based on the 5-celled von Neumann neighborhood.at n=49A272273
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 454", based on the 5-celled von Neumann neighborhood.at n=33A288395
- Total number of distinct Lyndon factors appearing in all words of length n over an alphabet of size 2.at n=8A290746
- p-INVERT of (1,1,0,0,0,0,...), where p(S) = 1 - S^4.at n=21A291379
- Number of n X n 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=4A298281
- Number of nX5 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=4A298284
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=40A298287
- Expansion of (1/x) * Series_Reversion( x / ((1+x)^4+x^2) ).at n=5A369213
- Cogrowth sequence of the 16-element modular group M4(2) = <S,T | S^8, T^2, STS^3T>.at n=8A377883
- Index where prime(n) appears as a term in A379442.at n=37A379558
- Composite numbers k such that A075255(k) is a square.at n=37A386245