11998
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20592
- Proper Divisor Sum (Aliquot Sum)
- 8594
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5136
- Möbius Function
- -1
- Radical
- 11998
- Omega Function (Ω)
- 3
- 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
- 187
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- E-trees with at most 3 colors.at n=6A007142
- Numbers k such that Sum_{j=1..k} sigma(j) is divisible by k, where sigma(j) = sum of divisors of j (A000203).at n=12A056550
- Expansion (1+x^3)/(1-x-x^7).at n=43A098527
- Number of lines through at least 2 points of a 7 X n grid of points.at n=33A160847
- a(n) = Number of subsets with n members of the set {1..n^2} such that the sum of the members is prime.at n=3A167147
- a(1)=4. a(n) = a(n-1) + n, if a(n-1)+n is composite. Otherwise a(n) = a(n-1)*n.at n=21A175459
- Triangle T(n,k) read by rows: the coefficient [x^k] of the product_{s=1..n} (x+64*cos(s*Pi/(2n+1))^6), 0<=k<=n.at n=29A179838
- Irregular triangle T(n,k) read by rows: T(n,k) is the number of compositions of n with k descents, n>=0, 0<=k<=floor(n/3).at n=54A238344
- Number of compositions of n with exactly three descents.at n=7A241628
- Number of magic labelings of the cycle-of-loops graph LOOP X C_6 having magic sum n, where LOOP is the 1-vertex, 1-loop-edge graph.at n=6A244879
- Number of nX6 0..1 arrays with every element equal to 0, 1, 2 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=4A302413
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=49A302415
- Number of 5Xn 0..1 arrays with every element equal to 0, 1, 2 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=5A302418
- Number of 5-element subsets of [n] having a prime element sum.at n=20A320680
- Expansion of Product_{1 <= i <= j <= k} 1/(1 - x^(i*j*k)).at n=27A321360
- Unbranched catafusenes, unsymmetrical.at n=11A323932
- Indices of records in A307730.at n=31A348449
- Terms in the Fibostracci sequence A359128 that arise as the sum of the two previous terms.at n=62A357048
- Sphenic numbers k such that none of k-2, k-1, k+1 and k+2 is squarefree.at n=35A362561
- Number of n X n Boolean relation matrices such that each of the diagonal blocks of its Frobenius normal form is either a 1 block or a 0 block.at n=4A365590