8390
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15120
- Proper Divisor Sum (Aliquot Sum)
- 6730
- 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
- 3352
- Möbius Function
- -1
- Radical
- 8390
- Omega Function (Ω)
- 3
- 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
- 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
- Erroneous version of A056642.at n=6A001199
- Numbers k such that sigma(k) = sigma(k+8).at n=16A015876
- Expansion of g.f. 1/((1-x)*(1-5*x)*(1-10*x)*(1-12*x)).at n=3A023947
- Number of linear spaces on n (labeled) points.at n=6A056642
- a(1) = 1; for n > 1, a(n) is the least k > a(n-1) such that a(n) + a(n-1) is square and a(n) - a(n-1) is prime.at n=22A108972
- a(n) = floor(((1+sqrt(2))/2)^n).at n=47A125894
- Divisors of 453060.at n=31A134950
- a(n) = 839*n.at n=10A135639
- Square array, read by antidiagonals, where row n+1 is generated from row n by first removing terms at positions [(m+3)^2/4 - 2] for m>=0 and then taking partial sums, starting with all 1's in row 0.at n=28A135878
- Square array, read by antidiagonals, where row n+1 is generated from row n by first removing terms at positions [(m+3)^2/4 - 2] for m>=0 and then taking partial sums, starting with all 1's in row 0.at n=29A135878
- Triangle, read by rows of A135901(n) terms, where row n+1 is generated from row n by inserting zeros at positions [(m+3)^2/4 - 2], as m=0,1,2,3,... and then taking partial sums from right to left, starting with a single 1 in row 0.at n=70A135879
- Triangle P, read by rows, where column k of P^2 equals column 0 of P^(2k+2) such that column 0 of P^2 equals column 0 of P shift one place left, with P(0,0)=1.at n=28A135880
- Column 0 of triangle A135880.at n=7A135881
- Triangle Q, read by rows, where column k of Q equals column 0 of Q^(k+1) and Q is equal to the matrix square of integer triangle P = A135880 such that column 0 of Q equals column 0 of P shift left.at n=21A135885
- Triangle R, read by rows, where column k of R equals column 0 of P^(2k+1) where P=A135880.at n=28A135894
- Triangle, read by rows equal to the matrix product P^-1*R, where P = A135880 and R = A135894; P^-1*R equals triangle P shifted right one column.at n=37A135898
- Triangle, read by rows equal to the matrix product P*R^-1*P, where P = A135880 and R = A135894; P*R^-1*P equals triangle Q=A135885 shifted down one row.at n=28A135899
- Triangle, read by rows equal to the matrix product R^-1*Q, where Q = A135885 and R = A135894; R^-1*Q equals triangle R shifted down one row.at n=36A135900
- Infinite product of triangle A167271 columns.at n=20A167273
- Triangle read by rows. T(n, k) = 2 * Eulerian(n, k - 1) - binomial(n - 1, k - 1)* binomial(n, k - 1) / k.at n=30A174159