8406
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 18252
- Proper Divisor Sum (Aliquot Sum)
- 9846
- 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
- 2796
- Möbius Function
- 0
- Radical
- 2802
- Omega Function (Ω)
- 4
- 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
- yes
- 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
- Number of bipartite partitions of n white objects and 8 black ones.at n=8A002757
- Number of bipartite partitions of n white objects and n black ones.at n=8A002774
- a(n) = n*(13*n - 1)/2.at n=36A022270
- Size of lexicographic code of length n, Hamming distance 6 and weight 6.at n=43A031504
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 90.at n=19A031588
- Numbers whose base-7 representation contains exactly four 3's.at n=17A043408
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives j values.at n=34A053720
- Numbers k such that 3*5^k - 2 is prime.at n=21A057917
- Number of bipartite partitions of ceiling(n/2) white objects and floor(n/2) black ones.at n=16A091437
- Largest achievable determinant of a 3 X 3 matrix whose elements are 9 distinct integers chosen from the range -n...n.at n=10A097693
- a(n) = A108462(A025487(n)).at n=24A108463
- a(n) is the smallest natural number we cannot obtain from n, n+1, n+2, n+3, n+4, n+5, n+6 and the operators +, -, *, /, using each number only once.at n=11A143191
- 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, 1, 0), (0, 1, -1), (0, 1, 0), (1, 0, 0)}.at n=8A149936
- Self-convolution of sequence A001402.at n=18A160647
- Indices of pentagonal pyramidal numbers which are the sum of two other such numbers: k such that A002411(k) = A002411(i)+A002411(j) for some i,j>0.at n=21A172437
- 1/4 the number of (n+1) X 6 binary arrays with all 2 X 2 subblock sums the same.at n=13A183982
- Number of 1X5 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2*n^2 (number of collections of 1 zero-sum 5-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).at n=17A192692
- Triangle read by rows: T(n,k) (0 <= k <= n) is the number of partitions of (n,k) into a sum of pairs.at n=44A201376
- a(n) = 5*n^2 + 1.at n=41A212656
- Number of n X 1 0..1 arrays with every row and column least squares fitting to a nonnegative slope straight line, with a single point array taken as having zero slope.at n=13A222855