8284
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 15400
- Proper Divisor Sum (Aliquot Sum)
- 7116
- 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
- 4142
- 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
- 127
- 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
- a(n) = floor( n*(n-1)*(n-2)/19 ).at n=55A011901
- Expansion of 1/(1-x^6-x^7-x^8-x^9-x^10-x^11-x^12-x^13-x^14-x^15-x^16).at n=46A017856
- Pseudoprimes to base 45.at n=40A020173
- Numbers k such that the continued fraction for sqrt(k) has period 72.at n=34A020411
- a(n) = T(2n, n), T given by A026758.at n=7A026759
- a(n) = T(n, floor(n/2)), T given by A026758.at n=14A026764
- Sum of squares of numbers in row n of array T given by A026758.at n=7A027237
- Dirichlet convolution of Bell numbers with themselves.at n=8A034770
- Sum of reciprocals of digits = 1.at n=42A037268
- Consider all integer triples (i,j,k), j >= k > 0, with i^3 = binomial(j+2,3) + binomial(k+2,3), ordered by increasing i; sequence gives i values.at n=12A054208
- Numbers n such that n | sigma_12(n).at n=15A055716
- Harmonic mean of digits is 4.at n=44A062182
- Triangle of numbers {a(n,k), n >= 0, 0 <= k <= n} defined by a(0,0)=1, a(n,0)=A000670(n), a(n,n)=A000629(n), a(n,k) = a(n,k-1) + a(n-1,k-1); a(n+1,0) = Sum_{k=0..n} a(n,k).at n=26A073146
- Number of unlabeled 2,3 cacti (triangular cacti with bridges).at n=11A091487
- Structured truncated cubic numbers.at n=11A100152
- Structured meta-anti-prism numbers, the n-th number from a structured n-gonal anti-prism number sequence.at n=11A100185
- a(n) = 4*(n^2 - n + 1).at n=45A112087
- Triangle read by rows: T(n,k) is the number of hill-free Schroeder paths of length 2n that have k weak ascents (1<=k<=n-1 for n>=2; k=1 for n=1). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A hill is a peak at height 1. A weak ascent in a Schroeder path is a maximal sequence of consecutive U and H steps.at n=24A114691
- Numbers k such that k and k^2 use only the digits 2, 4, 5, 6 and 8.at n=17A137095
- Table which contains in row n the mapping of the n-th block of 4 primes to 4 integers.at n=17A162156