8806
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
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 16416
- Proper Divisor Sum (Aliquot Sum)
- 7610
- 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
- 3456
- Möbius Function
- 1
- Radical
- 8806
- 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
- 140
- 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
- a(n) = T(n,n), T given by A026552. Also a(n) is the number of integer strings s(0),...,s(n) counted by T, such that s(n)=0.at n=12A026553
- Every run of digits of n in base 16 has length 2.at n=35A033014
- Positive integers having more base-16 runs of even length than odd.at n=37A044842
- McKay-Thompson series of class 39C for Monster.at n=44A058661
- McKay-Thompson series of class 39C for the Monster group with a(0) = 1.at n=44A094362
- Gaussian column reduction of Hankel matrix for central Delannoy numbers.at n=40A118384
- Expansion of Sum_{k>=0} x^(k^2+k)/((1-x)(1-x^2)...(1-x^(2k))).at n=52A122134
- 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, 1), (0, 1, 0), (0, 1, 1), (1, -1, -1)}.at n=8A149904
- Central coefficients of Riordan matrix A118384.at n=4A190726
- Floor-Sqrt transform of the binomial coefficients bin(2*n+1,n) (A001700).at n=14A192664
- Number of n X 3 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=16A207106
- Number of times an odd number is encountered, when going from (n+1)!-1 to n!-1 using the iterative process described in A219652.at n=7A219663
- Consider a non-palindromic number of k digits n = d_(k)*10^(k-1) + d_(k-1)*10^(k-2) + … + d_(2)*10 + d_(1). Sequence lists the numbers n such that Sum_{i=1..k-1}{phi(Sum_{j=1..i}{d_(j)*10^(j-1)})} = Sum_{i=1..k-1}{phi(Sum_{j=1..i}{d_(k-j+1)*10^(i-j)})} (see example below).at n=31A241503
- 1/n! times the number of ordered pairs of permutation functions f,g on n elements where f(f(x)) = g(f(g(x))).at n=18A255515
- a(n) = 2*n*(16*n - 13).at n=17A263228
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 86", based on the 5-celled von Neumann neighborhood.at n=33A270127
- Largest number k such that exactly half the numbers in [1..k] are prime(n)-smooth.at n=39A308904
- Sum of all the parts in the partitions of n into 7 squarefree parts.at n=34A308953
- E.g.f.: exp(-2) * Sum_{n>=0} ((1+x)^n + 1)^n / n!.at n=4A326431
- Triangle read by rows. Number T(n, k) of partitions of the multiset [1, 1, 1, 2, 2, 2, ..., n, n, n] into k nonempty subsets, for 3 <= k <= 3n.at n=26A360037