11648
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 28560
- Proper Divisor Sum (Aliquot Sum)
- 16912
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4608
- Möbius Function
- 0
- Radical
- 182
- Omega Function (Ω)
- 9
- 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
- 99
- 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 9 parts.at n=39A008638
- Expansion of ((theta_2)^4+(theta_3)^4)/Delta_24.at n=3A014703
- Expansion of 1/((1-2*x)*(1-6*x)).at n=5A016129
- 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 >= 2, t = natural numbers >= 3.at n=47A024869
- Numbers that are the sum of 4 nonzero squares in exactly 7 ways.at n=40A025363
- Number of partitions of n in which the greatest part is 9.at n=48A026815
- 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 53.at n=35A031551
- "DHK[ 6 ]" (bracelet, identity, unlabeled, 6 parts) transform of 1,1,1,1,...at n=22A032247
- Number of partitions satisfying cn(2,5) + cn(3,5) < cn(0,5) + cn(1,5) + cn(4,5).at n=35A039869
- Number of ways to arrange integers 1 through n so that the sum of each adjacent pair is prime, not counting reversals.at n=12A051239
- Jordan function J_3(n).at n=23A059376
- Numbers k such that z(k) = j(k), where z(k) = sopf(k - d(k)), j(k) = d(sopf(k) + k), sopf(k) = A008472(k) and d(k) = A000005(k).at n=18A063961
- Number of ways of writing the numbers 1 .. n in a sequence so that the sum of any two adjacent numbers is a prime; reversing the sequence does not count as different.at n=12A064821
- Numbers n such that sigma(4n+1)=6n.at n=7A067685
- Numbers k such that phi(k) + phi(k+1) = k.at n=15A067796
- Triangle of Legendre-Stirling numbers of the second kind T(n,j), n >= 1, 1 <= j <= n, read by rows.at n=22A071951
- a(n) is the number of essentially different ways in which the integers 1,2,3,...,n can be arranged in a sequence such that all pairs of adjacent integers sum to a prime number. Rotations and reversals are counted only once.at n=12A073452
- Triangle of scaled second column sequences of (k,k)-Stirling2 arrays.at n=22A091039
- Sixth column (m=5) of (1,4)-Pascal triangle A095666.at n=12A095668
- Expansion of x*(1+4*x-4*x^2)/((1+2*x)*(1-6*x)*(1-8*x^2)).at n=5A095897