5984
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 13608
- Proper Divisor Sum (Aliquot Sum)
- 7624
- 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
- 2560
- Möbius Function
- 0
- Radical
- 374
- Omega Function (Ω)
- 7
- 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
- yes
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 49
- 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=32A000292
- Sum of the first n even squares: a(n) = 2*n*(n+1)*(2*n+1)/3.at n=16A002492
- Number of acyclic digraphs with n unlabeled nodes.at n=6A003087
- Number of polygons of length 4n on Manhattan lattice.at n=6A006781
- Coordination sequence T1 for Zeolite Code BIK.at n=47A008047
- Binomial coefficient C(34,n).at n=3A010950
- Binomial coefficient C(n,31).at n=3A010984
- Even tetrahedral numbers.at n=24A015220
- Expansion of 1/(1-x^5-x^6-x^7-x^8-x^9-x^10-x^11).at n=41A017842
- Numbers k such that k + sum of its prime factors = (k+1) + sum of its prime factors.at n=18A020700
- a(n) = Sum_{k=0..m} (k+1) * A026120(n, k), where m=0 for n=0,1; m=n for n >= 2.at n=7A027326
- Expansion of (theta_3(z)*theta_3(23z)+theta_2(z)*theta_2(23z))^4.at n=22A028660
- (prime(n)-5)(prime(n)-7)(prime(n)-9)/48.at n=18A030002
- a(n) = (prime(n)-3)*(prime(n)-5)*(prime(n)-7)/48.at n=18A030003
- Longest edge a of smallest (measured by the longest edge) primitive Euler bricks (a, b, c, sqrt(a^2 + b^2), sqrt(b^2 + c^2), sqrt(a^2 + c^2) are integers).at n=11A031173
- 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 37.at n=35A031535
- Duplicate of A002492.at n=16A035007
- Duplicate of A002492.at n=16A047810
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/2 of the elements are <= sqrt(n).at n=20A048093
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.at n=42A050037