8014
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12024
- Proper Divisor Sum (Aliquot Sum)
- 4010
- 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
- 4006
- Möbius Function
- 1
- Radical
- 8014
- Omega Function (Ω)
- 2
- 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
- 44
- Smith Number
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 84.at n=21A020423
- Ordered sequence of distinct terms of the form floor(exp(i) * floor(exp(j))), i,j >= 0.at n=38A022765
- a(n+1) = Sum_{k=0..floor(n/5)} a(k) * a(n-k).at n=20A030036
- 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 88.at n=19A031586
- Numbers whose base-6 representation has exactly 6 runs.at n=13A043614
- a(n)=Sum_{j = 0..n} binomial(phi(n),phi(j)).at n=25A073317
- Double partial sums of (n * its dyadic valuation).at n=36A090889
- Number of partitions of n such that the least part occurs with even multiplicity.at n=35A096374
- a(n) = a(n-1) + Sum_{k=1..floor(n/4)} a(n-4k), with a(0)=1.at n=27A113439
- Fourth row of A113439.at n=6A113443
- Numbers k such that 4^k - 5 is prime.at n=30A217348
- Numbers n such that the distance from 2^(2n) to the prev prime is the same as the distance from (2n)^2 to the prev prime.at n=16A226650
- Number of (2+1) X (n+1) 0..1 arrays with every 2 X 2 subblock ne-sw antidiagonal difference nondecreasing horizontally and nw+se diagonal sum nondecreasing vertically.at n=20A258555
- Total number of permutations on {1,2,...,n} that have a unique longest increasing subsequence and a unique longest decreasing subsequence.at n=8A258683
- G.f. A(x) satisfies: 1 = Product_{n>=1} (1 - x^n) * (1 - x^(n+1)/A(x)) * (1 - x^(n-2)*A(x)).at n=11A268651
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 414", based on the 5-celled von Neumann neighborhood.at n=26A272014
- a(n) = (5/128)*n^4*(n mod 2) + (((-5/128)*n^4*(n mod 2) - 26) mod n) + n^3 (n > 0).at n=19A294264
- a(0) = a(1) = 1; a(n) = [x^n] Product_{k=1..n-1} (1 + x^a(k))/(1 - x^a(k)).at n=41A296387
- Partial sums of A301718.at n=53A301719
- a(n) is the minimal positive value of m such that A325433(2m, 2n+1) > A364891(2m, 2n+1).at n=43A364893