8349
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
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 12768
- Proper Divisor Sum (Aliquot Sum)
- 4419
- 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
- 4840
- Möbius Function
- 0
- Radical
- 759
- 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
- 114
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) is the number of partitions of n (the partition numbers).at n=32A000041
- Largest number not the sum of distinct n-th-order polygonal numbers.at n=30A007419
- Expansion of sin(sinh(x)*cos(x)).at n=5A009495
- Number of partitions of n into parts having a common factor.at n=64A018783
- a(n) is number of cycles in Moebius ladder M_n.at n=13A020873
- Expansion of Product_{m >= 1} (1-m*q^m)^11.at n=13A022671
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = (natural numbers), t = (natural numbers >= 3).at n=43A024854
- 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=33A031558
- Number of partitions of n into even parts.at n=64A035363
- Number of partitions of n into parts not of the form 23k, 23k+11 or 23k-11. Also number of partitions with at most 10 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=33A035999
- Number of binary rooted trees with n nodes and height at most 9.at n=15A036592
- Earliest sequence where a(a(n))=number of partitions of n.at n=33A038752
- Nonprime partition numbers.at n=25A038753
- Number of partitions satisfying 0 < cn(1,5) + cn(4,5) + cn(2,5) + cn(3,5).at n=32A039896
- Odd partition numbers.at n=16A052003
- Number of ways to partition 2n into positive integers.at n=16A058696
- a(n) = number of partitions of 2^n.at n=5A068413
- Smallest partition number divisible by n.at n=22A072871
- Partition numbers of the form 3*k.at n=13A087183
- Number of partitions of n-th composite number containing the smallest prime factor: a(n) = A027293(A002808(n), A056608(n)).at n=21A091114