8358
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 19200
- Proper Divisor Sum (Aliquot Sum)
- 10842
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2376
- Möbius Function
- 1
- Radical
- 8358
- 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
- 65
- 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) = round(n*phi^11), where phi is the golden ratio, A001622.at n=42A004946
- Coordination sequence for MgZn2, Position Zn1.at n=23A009937
- A generalized difference set on the set of all integers (lambda = 1).at n=21A024431
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A014306.at n=35A024596
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = A014306.at n=34A025110
- G.f.: Product_{k>=1} (1 + 2*x^k).at n=31A032302
- Number of partitions of n into parts not of the form 17k, 17k+2 or 17k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 7 are greater than 1.at n=38A035963
- (7*n^3+4*n^2+4*n)*binomial(2*n,n)/30.at n=5A036973
- Number of partitions satisfying cn(1,5) <= cn(0,5) + cn(2,5) + cn(3,5) and cn(4,5) <= cn(0,5) + cn(2,5) + cn(3,5).at n=34A039870
- Numbers whose base-4 representation contains exactly two 0's and four 2's.at n=27A045051
- Number of 2n-bead black-white reversible complementable necklaces with n black beads and fundamental period 2n.at n=11A045633
- Number of wide partitions of n.at n=45A070830
- Smallest multiple of the n-th prime such that the n-th partial sum is divisible by n.at n=45A074105
- Generalized Poly-Bernoulli numbers.at n=6A081675
- Starting numbers for which the RATS sequence has eventual period 14.at n=14A114615
- Start with 1 and repeatedly reverse the digits and add 35 to get the next term.at n=40A118632
- a(n) = a(n-1) + a(n-2) + 4, with a(0)=0, a(1)=2.at n=16A168193
- Triangle, read by rows, where the g.f. of row n equals Product_{k=0..n-1} (1 + k*y + y^2) for n>0 with a single '1' in row 0.at n=56A201949
- Central coefficients in Product_{k=0..n-1} (1 + k*x + x^2).at n=7A201950
- n*(n^2-2*n-1).at n=20A214446