8236
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 15120
- Proper Divisor Sum (Aliquot Sum)
- 6884
- 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
- 3920
- Möbius Function
- 0
- Radical
- 4118
- 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
- 39
- 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
- Write 1,2,... in a clockwise spiral; sequence gives numbers on positive x axis.at n=45A033951
- Number of partitions of n with equal number of parts congruent to each of 0 and 1 (mod 5).at n=45A035552
- Numbers whose base-4 representation contains exactly four 0's and no 1's.at n=29A045033
- Numbers whose base-4 representation contains exactly four 0's and two 2's.at n=29A045059
- Let N(k) and D(k) be the sequences defined in A054765 and A012244; write N(k)* D(k+j ) - N(k+j)*D(k) = (-1)^(k+1)*(k!)^2*P(k) where P(k) is a polynomial in k of degree j-1; sequence gives coefficients of expansion of P(k) in powers of k for j=1,2,3,...at n=17A054798
- Number of 3 X n nonnegative integer matrices with all column sums 3, up to row and column permutation.at n=9A058407
- Ulam numbers such that n/2 is also an Ulam number.at n=18A068799
- Limit of A069258(k,n) = number of partitions of 2*k into k-n prime parts, as k tends to infinity.at n=37A069259
- Non-balanced numbers in A015765.at n=35A074868
- The number of possible values of the squarefree kernel (A007947) shared by at least two solutions x to A056239(x) = n.at n=45A088318
- Poincaré series [or Poincare series] (or Molien series) for a certain four-fold wreath product P_4.at n=43A091434
- Number of one-element transitions among all integer partitions of the integers from m=0 to m=n in the unlabeled case.at n=15A096586
- a(n) = (10^k - n)(10^k + n), where k is the number of digits in n.at n=41A110397
- G.f.: (1-2*x+2*x^2-x^3+x^4-x^5+2*x^6-2*x^7+x^8)/((1-x)^2*(1-x^2)*(1-x^3)*(1-x^6)).at n=49A127825
- Number of isomers of the soccerball C_60H_n Buckminster fullerene.at n=4A133998
- Binomial transform of [1, 3, 3, 1, 1, -1, 1, -1, 1, ...].at n=29A140226
- a(0)=0 and a(n+1) = 3*a(n) + 2^(n+2).at n=7A145563
- 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, 1), (0, 0, -1), (1, 0, 0)}.at n=10A148162
- 4 times heptagonal numbers: a(n) = 2*n*(5*n-3).at n=29A153784
- Number of binary strings of length n with no substrings equal to 0010 or 1001.at n=11A164403