11614
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
- 17424
- Proper Divisor Sum (Aliquot Sum)
- 5810
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5806
- Möbius Function
- 1
- Radical
- 11614
- 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
- 112
- 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
- Number of factorization patterns of polynomials of degree n over F_2.at n=25A006167
- Smallest positive number that can be written as sum of distinct Fibonacci numbers in n ways.at n=76A013583
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = [ n/2 ], s = (natural numbers >= 2), t = (Lucas numbers).at n=13A024873
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 90 ones.at n=3A031858
- Number of basis partitions of n+16 with Durfee square size 4.at n=47A053798
- Number of partitions of n in which the number of parts divides n.at n=50A067538
- Expansion of x/((1-x)*(1-x^2-2*x^3)).at n=23A077882
- a(n) = n^3 - n^2 - n - 1.at n=23A083074
- a(n) = sigma_3(n) - sigma_2(n) - sigma_1(n).at n=22A092350
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (0, -1, 0), (1, 1, 0), (1, 1, 1)}.at n=7A150905
- Number of different fixed (possibly) disconnected trominoes bounded tightly by an n X n square.at n=44A163433
- Constant term of the reduction by x^2 -> x+1 of the polynomial p(n,x)=(x+1)(x+2)...(x+F(n+1)), where F=A000045, the Fibonacci sequence.at n=6A192943
- Number of unbalanced partitions of n: the largest part is not equal to the number of parts.at n=33A236634
- Number of partitions p of n such that if h = min(p), then h is an (h,1)-separator of p; see Comments.at n=50A239497
- A specially constructed B_2 sequence with sum of reciprocals greater than that of the Mian-Chowla sequence A005282.at n=70A259964
- Number of nX3 0..1 arrays with every element equal to 1, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=6A297946
- Number of n X 7 0..1 arrays with every element equal to 1, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=2A297950
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=38A297951
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=42A297951
- Number of nX7 0..1 arrays with every element equal to 1, 2, 3, 5 or 7 king-move adjacent elements, with upper left element zero.at n=2A298559