11298
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 25920
- Proper Divisor Sum (Aliquot Sum)
- 14622
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3216
- Möbius Function
- 1
- Radical
- 11298
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 37
- 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
- Number of solid partitions of n supported on graph of cube.at n=24A003404
- Riordan numbers: a(n) = (n-1)*(2*a(n-1) + 3*a(n-2))/(n+1).at n=13A005043
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = (composite numbers).at n=20A024471
- Number of bracelets (turnover necklaces) of n beads of 2 colors, 5 of them black.at n=38A032279
- a(n) = prime(n) + n^3 + n^2 + 4n - 1.at n=21A060822
- Starting positions of strings of three 7's in the decimal expansion of Pi.at n=11A083631
- Numbers n such that the product of digits of n equals the concatenation of pi(d)'s where d runs through the digits of n.at n=13A097228
- Bisection of A005043.at n=6A099252
- Zeroless numbers for which the sum of the digits and the product of the digits are both Fibonacci numbers.at n=37A117725
- Number of parts in all the compositions of n into primes (i.e., in all ordered sequences of primes having sum n).at n=20A121304
- Triangle read by rows: T(n,k) is the number of paths in the first quadrant from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k doublerises (i.e., UU's) (0 <= k <= floor(n/2) - 1 for n >= 2).at n=27A132279
- Number of reduced words of length n in the Weyl group B_8.at n=10A161717
- First column of A174295.at n=15A174297
- G.f. satisfies: A(x) = 1 + x/A(-x)^2.at n=10A213252
- Number of length n+3 0..2 arrays with no four elements in a row with pattern abba (possibly a=b) and new values 0..2 introduced in 0..2 order.at n=7A243027
- T(n,k)=Number of length n+3 0..k arrays with no four elements in a row with pattern abba (possibly a=b) and new values 0..k introduced in 0..k order.at n=43A243033
- Numbers k such that 1 + k + k^3 + k^5 + k^7 + k^9 + ... + k^57 is prime.at n=32A244390
- Growth series for affine Coxeter group (or affine Weyl group) D_11.at n=6A266766
- Growth series for affine Coxeter group B_11.at n=6A267174
- Magic sums of 4 X 4 semimagic squares composed of consecutive primes.at n=17A270864