11304
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 30810
- Proper Divisor Sum (Aliquot Sum)
- 19506
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3744
- Möbius Function
- 0
- Radical
- 942
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 130
- 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
- yes
- Odd
- no
Appears in sequences
- Number of permutations of [n] in which the longest increasing run has length 5.at n=8A000456
- Triangle read by rows: T(n,k) (n>=1; 1<=k<=n) is the number of permutations of [n] in which the longest increasing run has length k.at n=40A008304
- a(n) = T(n, n-3), T given by A026519. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 3.at n=10A026523
- a(n) = T(n, n-3), T given by A026552. Also a(n) = number of integer strings s(0), ..., s(n) counted by T, such that s(n) = 3.at n=10A026556
- Numbers that are divisible by 6 (and 18) and are differences between two cubes in at least one way.at n=35A038852
- Numbers ending with '4' that are the difference of two positive cubes.at n=26A038859
- Triangle read by rows: T(n,k) = the number of ascending runs of length k in the permutations of [n] for k <= n.at n=40A122843
- a(0)=1. a(n) = sum of the earlier terms which are divisible by (the number of 1's in the binary representation of n).at n=22A123757
- Triangle read by rows: T(n,k) = a(k)*binomial(n,k) (0 <= k <= n), where a(0)=1, a(1)=2, a(k) = a(k-1) + 3*a(k-2) for k >= 2 (a(k) = A006138(k)).at n=52A124959
- Number of binary strings of length n with equal numbers of 00010 and 01000 substrings.at n=14A164214
- Expansion of 1/((1 - x^3 - x^4)*(1 + x)).at n=56A175790
- Number of strings of numbers x(i=1..6) in 0..n with sum i*x(i)^2 equal to n*36.at n=14A184445
- Number of rhombuses on a (n+1)X8 grid.at n=41A190096
- Number of compositions (ordered partitions) of n into at least 2 distinct positive parts.at n=26A216695
- 4-loop graph coloring a rectangular array: number of n X 2 0..8 arrays where 0..8 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 0,5 5,6 6,0 0,7 7,8 8,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=3A223291
- 4-loop graph coloring a rectangular array: number of nX4 0..8 arrays where 0..8 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 0,5 5,6 6,0 0,7 7,8 8,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=1A223293
- T(n,k)=4-loop graph coloring a rectangular array: number of nXk 0..8 arrays where 0..8 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 0,5 5,6 6,0 0,7 7,8 8,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=11A223297
- T(n,k)=4-loop graph coloring a rectangular array: number of nXk 0..8 arrays where 0..8 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 0,5 5,6 6,0 0,7 7,8 8,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=13A223297
- Number of permutations of [2n+1] in which the longest increasing run has length n+1.at n=4A230251
- Row sums of irregular tables A252753 & A252755.at n=7A253787