11097
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 16698
- Proper Divisor Sum (Aliquot Sum)
- 5601
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7344
- Möbius Function
- 0
- Radical
- 411
- Omega Function (Ω)
- 5
- 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
- 68
- 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
- no
- Odd
- yes
Appears in sequences
- Number of discordant permutations.at n=3A000564
- Lucky numbers with size of gaps equal to 16 (lower terms).at n=34A031898
- Numerators of continued fraction convergents to sqrt(666).at n=7A042280
- a(n) = Sum_{i=0..n} A047060(i,n-i).at n=15A047061
- Triangle T(n,k) defined by Sum_{n >= 0,m >= 0} T(n,m)*x^m*y^n = 1 + y*(1 + 3*x - 4*x^2*y - 3*x^2*y^2 - 3*x^3*y^2 + 4*x^4*y^3)/((1 - y - 2*x*y - x*y^2 + x^3*y^3)*(1 - x*y)).at n=51A061702
- a(n) = 3*(2*n^2 + 1).at n=43A097803
- A weighted tribonacci, (1,2,4).at n=10A102001
- Triangle read by rows: T(n,k) is the number of k-matchings in the C_n X P_2 graph (C_n is the cycle graph on n vertices and P_2 is the path graph on 2 vertices).at n=48A102079
- 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, 0, 0), (1, 0, 0), (1, 0, 1), (1, 1, 0)}.at n=7A151162
- Composite numbers n such that 8*n^2-2*n-1 divides the primitive part U(n) of Fibonacci(n).at n=25A159234
- One fifth of product plus sum of five consecutive nonnegative numbers.at n=7A166942
- Number of (w,x,y,z) with all terms in {1,...,n} and w^3>=x^3+y^3+z^3.at n=16A212100
- a(n) = Sum_{i=0..n} digsum_9(i)^3, where digsum_9(i) = A053830(i).at n=38A231686
- Number of numbers in row n of the array at A243848.at n=22A243850
- Number of 3Xn arrays containing n copies of 0..3-1 with no element 1 greater than its north or northeast neighbor modulo 3 and the upper left element equal to 0.at n=7A266600
- T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any north or northeast neighbors modulo n and the upper left element equal to 0.at n=47A267553
- a(n) = 8n^2 - 12n + 1.at n=36A273220
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 934", based on the 5-celled von Neumann neighborhood.at n=32A273794
- a(n) = a(n-1) + a(n-3) + a(n-5) - a(n-6), a(0) = a(1) = a(2) = 1, a(3) = 2, a(4) = 3, a(5) = 5.at n=24A278706
- Number of 4-cycles in the n X n black bishop graph.at n=12A289162