8476
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 16072
- Proper Divisor Sum (Aliquot Sum)
- 7596
- 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
- 3888
- Möbius Function
- 0
- Radical
- 4238
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 83
- 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 partitions into non-integral powers.at n=10A000345
- a(n) = (n+1)*(n^2+n+2)/2; g.f.: (1 + 2*x^2) / (1 - x)^4.at n=25A006000
- a(n) = n + (n+1)^2 + (n+2)^3 + (n+3)^4 + (n+4)^5.at n=2A027622
- 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 46.at n=38A031544
- a(n) = (n^3 + 5*n + 18)/6.at n=39A060163
- Numbers k such that sopfr(k) = sopf(k+1), where sopf(k) = A008472(k) and sopfr(k) = A001414(k).at n=11A064675
- Convolution of A000010 with itself.at n=48A065093
- Number of 1's in all partitions of n with no even parts repeated.at n=29A117276
- Start with 1 and repeatedly reverse the digits and add 47 to get the next term.at n=21A118145
- Concatenation of first two digits and last two digits of n-th even superperfect number A061652(n).at n=45A138869
- A functionally symmetric Polynomial as a triangle of coefficients: p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 3)*Sum[(3^(m-1) + 2*m+1 )*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=38A146958
- A functionally symmetric Polynomial as a triangle of coefficients: p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 3)*Sum[(3^(m-1) + 2*m+1 )*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=42A146958
- G.f.: A(x) = exp( Sum_{n>=1} [ D^n x/(1-x)^2 ]^n/n ), where differential operator D = x*d/dx.at n=6A159596
- 28-gonal numbers: a(n) = n*(13*n - 12).at n=26A161935
- Number of numerical semigroups of multiplicity n and genus n+2.at n=37A180739
- Number of nX2 0..4 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=6A201027
- Number of n X 7 0..4 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=1A201032
- T(n,k)=Number of nXk 0..4 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=29A201033
- T(n,k)=Number of nXk 0..4 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=34A201033
- Number of 5-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero and first differences in -n..n.at n=13A209033