8436
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 21280
- Proper Divisor Sum (Aliquot Sum)
- 12844
- 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
- 2592
- Möbius Function
- 0
- Radical
- 4218
- Omega Function (Ω)
- 5
- 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
- yes
- 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
- Tetrahedral (or triangular pyramidal) numbers: a(n) = C(n+2,3) = n*(n+1)*(n+2)/6.at n=36A000292
- a(0) = 1, a(1) = 0, a(2) = -1; for n >= 3, a(n) = - a(n-2) + Sum_{ primes p with 3 <= p <= n} a(n-p).at n=56A002121
- Sum of the first n even squares: a(n) = 2*n*(n+1)*(2*n+1)/3.at n=18A002492
- a(n) = Sum_{k=1..n-1} lcm(k,n-k).at n=37A006580
- Binomial coefficient C(38,n).at n=3A010954
- Binomial coefficient C(n,35).at n=3A010988
- Even tetrahedral numbers.at n=27A015220
- Number of 5-tuples of different integers from [ 1,n ] with no global factor.at n=17A015640
- Number of 5-tuples of different integers from [ 2,n ] with no global factor.at n=17A015641
- Least k such that first k terms of A022300 contain n more 2's than 1's.at n=7A025515
- a(n) = (prime(n)-3)*(prime(n)-5)*(prime(n)-7)/48.at n=20A030003
- Numbers having period-2 6-digitized sequences.at n=29A031357
- 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 60.at n=37A031558
- 12 times triangular numbers.at n=37A049598
- T(n,3), array T as in A050186; a count of aperiodic binary words.at n=35A050188
- Numbers n such that n | sigma_12(n).at n=16A055716
- a(n) = Sum_{k = 1..n, gcd(k,n)=1} k*(n-k).at n=36A057789
- Triangle of triangular binomial coefficients, read by rows, where column k has the g.f.: 1/(1-x)^((k+1)*(k+2)/2) for k >= 0.at n=62A098568
- Sums of area and perimeter of primitive Pythagorean triples.at n=41A105521
- Total number of parts that appear exactly once in the partitions of n into odd parts.at n=51A116665