5604
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 13104
- Proper Divisor Sum (Aliquot Sum)
- 7500
- 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
- 1864
- Möbius Function
- 0
- Radical
- 2802
- 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
- 98
- 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) is the number of partitions of n (the partition numbers).at n=30A000041
- Value of x corresponding to the minimal solution of the Pell equation x^2+d*y^2, as d runs through the squarefree numbers.at n=59A023677
- Number of partitions of n into even parts.at n=60A035363
- Maximal base 7 run length is 4.at n=23A037991
- Nonprime partition numbers.at n=23A038753
- Numerators of continued fraction convergents to sqrt(97).at n=10A041174
- Numbers whose base-7 representation contains exactly four 2's.at n=11A043404
- Even partition numbers.at n=13A052001
- Number of ways to partition 2n into positive integers.at n=15A058696
- a(n) = p(p(n)), p = partition numbers A000041.at n=9A058699
- Coefficients of replicable function number 49a.at n=53A058700
- a(n) is smallest natural number a satisfying Pell equation a^2 - d(n)*b^2= +1 or = -1, with d(n)=A000037(n) (a nonsquare). Corresponding smallest b(n)=A077233(n).at n=87A077232
- Partition numbers of the form 3*k.at n=12A087183
- Number of partitions of n-th composite number containing the smallest prime factor: a(n) = A027293(A002808(n), A056608(n)).at n=20A091114
- Number of partitions of n-th composite number containing the smallest prime factor: a(n) = A027293(A002808(n), A056608(n)).at n=19A091114
- Number of partitions of n-th composite number containing the smallest prime factor: a(n) = A027293(A002808(n), A056608(n)).at n=22A091114
- a(n) = (1/24) * (A018188(n)-11).at n=38A092153
- Let p(n) be the n-th prime congruent to 1 mod 4. Then a(n) = the least m for which m^2+1=p(n)*k^2 has a solution.at n=10A094048
- Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n containing k U H^j Us for some j>0, where U=(1,1) and H=(1,0) (can be easily expressed using RNA secondary structure terminology).at n=30A097777
- Number of partitions of n into integers not greater than the squarefree kernel of n.at n=29A098715