7104
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 28
- Divisor Sum
- 19304
- Proper Divisor Sum (Aliquot Sum)
- 12200
- 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
- 2304
- Möbius Function
- 0
- Radical
- 222
- Omega Function (Ω)
- 8
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 75
- 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
- Number of partitions of n into at most 6 parts.at n=47A001402
- a(n) = n*(n+4)*(n+5)/6.at n=32A005586
- Expansion of Product_{m>=1} (1+m*q^m)^32.at n=3A022660
- Number of partitions of n into 6 unordered relatively prime parts.at n=47A023026
- a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0 = s(n), |s(i) - s(i-1)| = 1 for i = 1,2,3; |s(i) - s(i-1)| <= 1 for i >= 4. Also a(n) = T(n,n), where T is the array defined in A026082.at n=7A026083
- Number of partitions of n in which the greatest part is 6.at n=53A026812
- 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 41.at n=33A031539
- Number of partitions satisfying (cn(0,5) = 0 and cn(1,5) = cn(4,5)).at n=50A036818
- McKay-Thompson series of class 45A for Monster.at n=50A058684
- Numbers k such that sigma(x) = k has exactly 6 solutions.at n=33A060662
- a(1) = 1, a(n) = a(n - 1) + pi(a(n - 1)) + 1.at n=37A065962
- Numbers n such that n + sum of prime factors of n = (n+1) + sum of prime factors of (n+1).at n=12A075654
- a(n) = (n^3 + 24*n^2 + 65*n + 36)/6.at n=28A087863
- Number of partitions of n into parts not greater than sqrt(n).at n=47A097356
- Expansion of 1/sqrt(1-4*x-12*x^2+48*x^3).at n=7A106185
- Expansion of Im(x/(1 - x - 2*i*x^2)), i=sqrt(-1).at n=18A106202
- Sum of primes q with prime(n) < q < 2*prime(n).at n=39A108313
- Triangle read by rows: T(n,k) is the number of ternary words of length n on {0,1,2}, having k isolated 0's (n >= 0, k >= 0).at n=30A120924
- a(n) = (n-2)*(n+3)*(n+2)/6.at n=34A129936
- a(n) = n*(7*n-2).at n=32A135703