8033
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8340
- Proper Divisor Sum (Aliquot Sum)
- 307
- 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
- 7728
- Möbius Function
- 1
- Radical
- 8033
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 96
- Smith Number
- no
- 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
- no
- Odd
- yes
Appears in sequences
- Number of partitions of n into at most 7 parts.at n=42A008636
- Expansion of e.g.f. exp(tanh(x)*exp(x)).at n=8A009268
- Number of partitions of n in which the greatest part is 7.at n=49A026813
- Expansion of (1 - x - 6*x^2)/((1 - x)*(1 - x - 8*x^2)).at n=9A100302
- Triangle formed by coefficients of the expansion of p(x, n), where p(x,n) = (1+x-x^2)^(n+1)*Sum_{j >= 0} (j+1)^n*(-x + x^2)^j.at n=60A156890
- Partial sums of number of different shapes formed by bending a piece of wire of length n in the plane A066372.at n=16A178937
- Irregular triangle of the square root of the sums of squares mentioned in A184763.at n=28A184886
- Number of permutations of 1..n with displacements restricted to {-5,-4,0,1,2,3}.at n=11A189592
- Number of partitions of n^2-n into parts not greater than n.at n=7A206240
- Sequence of coefficients of x in marked mesh pattern generating function Q_{n,132}^(5,0,-,0)(x).at n=5A213165
- Number of composite Lucas numbers between the prime Lucas numbers A005479(n) and A005479(n+1).at n=46A245472
- The number of binary heaps on n elements whose breadth-first search reading word avoids 321.at n=11A246829
- Number of partitions of 7n into 7 parts.at n=7A256287
- E.g.f.: Limit_{N->oo} [ Sum_{n>=0} (N + n)^(4*n) * (x/N^3)^n/n! ]^(1/N).at n=4A266483
- Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 147", based on the 5-celled von Neumann neighborhood.at n=45A270290
- Compound filter: a(n) = P(sigma(n), sigma(2n)), where P(n,k) is sequence A000027 used as a pairing function, and sigma is the sum of divisors (A000203).at n=20A286359
- Compound filter: a(n) = P(sigma(n), sigma(2n)), where P(n,k) is sequence A000027 used as a pairing function, and sigma is the sum of divisors (A000203).at n=30A286359
- Positions of records in A033178.at n=26A309230
- Semiprimes in A072226.at n=49A317299
- A variation of A330252: the same rules for a(n) apply with an additional rule a(n) = n if a(n-1) = 0. This sequence lists the n values where a(n) = 0.at n=42A330253