8637
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
- 4
- Divisor Sum
- 11520
- Proper Divisor Sum (Aliquot Sum)
- 2883
- 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
- 5756
- Möbius Function
- 1
- Radical
- 8637
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = floor( n*(n-1)*(n-2)/25 ).at n=61A011907
- Number of partitions satisfying (cn(0,5) <= cn(2,5) = cn(3,5) and cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5)).at n=46A036807
- Numbers k such that k^4 can be written as a sum of four positive 4th powers with no common factor.at n=28A039664
- Maximal elements of pairs of "Super Unitary Amicable Numbers", sorted by their minimal elements.at n=22A045614
- Number of products of distinct factorials not exceeding n!.at n=33A101977
- Positions of records in A064097.at n=21A105017
- Number of partitions of n into "number of partitions of n into 'number of partitions of n into partition numbers' numbers" numbers.at n=49A130899
- Number of distinct means of nonempty subsets of {1,...,n}.at n=43A135342
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 11011-01110-00100 pattern in any orientation.at n=22A147486
- a(n) = Least i in range [A165583(n),A165583(n+1)] for which abs(A165582(i)) gets the maximum value in that range.at n=43A165584
- Numbers n that (n^3 - 4,n^3 - 2) is a twin prime pair.at n=33A178507
- Smallest number with "natural" logarithm n, cf. A061373.at n=32A182061
- a(0)=0, a(1)=1, a(n) = ( (a(n-1)+a(n-2)) XOR n) + n.at n=17A182506
- T(n,k) = Sum_{j=0..k} (k-j)^n * binomial(n,j).at n=39A215080
- The Wiener index of the graph obtained by applying Mycielski's construction to the path graph on n vertices (n>=2).at n=37A228321
- Number of sets of exactly n positive integers <= n+6 having a square element sum.at n=21A281969
- Number of Carlitz compositions of n that either have length 1, or have length greater than or equal to 2 and are palindromic if we exclude the first part.at n=30A291941
- a(n) = s(n,n) + s(n,n-1) + s(n,n-2), where s(n,k) are the unsigned Stirling numbers of the first kind (see A132393).at n=16A308305
- Indices of primes followed by a gap (distance to next larger prime) of 36.at n=41A320716
- Triangle read by rows: T(n,m) (n >= m >= 1) = number of vertices formed by drawing the lines connecting any two of the 2*(m+n) perimeter points of an m X n grid of squares.at n=48A331453