11146
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16722
- Proper Divisor Sum (Aliquot Sum)
- 5576
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5572
- Möbius Function
- 1
- Radical
- 11146
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 37
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- a(n) = 1 + L(n) + F(2*n-1) with {L(n)}_{n>=0} the Lucas numbers (A000032) and F(2*n-1)_{n>=0} the bisected Fibonacci numbers (A001519).at n=11A005522
- Numbers k such that the continued fraction for sqrt(k) has period 95.at n=7A020434
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A000201 (lower Wythoff sequence).at n=33A025113
- Numbers k such that 249*2^k+1 is prime.at n=43A032501
- Symmetric totally balanced binary sequences: those terms of A014486 which are equal to their reversed complement.at n=45A061855
- Expansion of ((eta(q^2) * eta(q^14)) / (eta(q) * eta(q^7)))^3 in powers of q.at n=18A120006
- Expansion of eta(q^4) * eta(q^28) / (eta(q) * eta(q^7)) in powers of q.at n=37A123648
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k primitive Dyck factors (n >= 0; 0 <= k <= n).at n=46A129154
- Numbers k such that k and k^2 use only the digits 1, 2, 3, 4 and 6.at n=23A136969
- Number of partitions p of 2n+1 such that n - (number of parts of p) is a part of p.at n=19A238742
- Number of partitions of n containing m(4) as a part, where m denotes multiplicity.at n=39A240489
- Total number of incoming edges at depth n in the solid partitions graph.at n=9A244252
- Numbers k such that the decimal expansions of both k and k^2 have 1 as smallest digit and 6 as largest digit.at n=15A257197
- Number of (n+1)X(1+1) 0..2 arrays with each row and column prime, read as a base 3 number with top and left being the most significant digits.at n=8A262117
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with each row and column prime, read as a base 3 number with top and left being the most significant digits.at n=36A262122
- Number of partitions p of n such that min(p) < (number of parts of p) <= max(p).at n=36A325342
- Coefficients in the power series expansion of A(x) = Sum_{n=-oo..+oo} n*(n+1)*(n+2)/6 * x^(3*n) * (1 - x^n)^(n-2).at n=42A357156