11406
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22824
- Proper Divisor Sum (Aliquot Sum)
- 11418
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3800
- Möbius Function
- -1
- Radical
- 11406
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 55
- 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
- G.f.: (1 + Sum_{ i >= 0 } 2^i*x^(2^(i+1)-1)) / (1-x)^3.at n=43A063916
- Number of partitions of n into parts congruent to {0, 1, 3, 5} mod 6.at n=51A096981
- Number of ways to label the vertices of the octahedron (or faces of the cube) with nonnegative integers summing to n, where labelings that differ only by rotation or reflection are considered the same.at n=32A097513
- Lesser of twin admirable numbers: k such that k and k+2 are both admirable numbers.at n=39A109730
- Number of base 18 n-digit numbers with adjacent digits differing by one or less.at n=7A126372
- Triangle, read by rows, where column k of T = column 0 of matrix power T^{(k+1)(k+2)/2} for k>=0, with T(n,0)=1 for n>=0.at n=23A134523
- Column 2 of triangle T=A134523, also equals column 0 of the matrix power T^6, where column k of T = column 0 of matrix power T^{(k+1)(k+2)/2} for k>=0.at n=4A134525
- Number of partitions of n with distinct numbers of odd and even parts.at n=34A171967
- Number of n X 7 binary arrays without the pattern 0 1 diagonally, vertically or antidiagonally.at n=16A188864
- Numbers n that can be expressed as the sum of the arithmetic derivatives of k consecutive numbers starting from n for some k.at n=13A195333
- Initial members of abundant quadruplets, i.e., values of k such that (k, k+2, k+4, k+6) are all abundant numbers.at n=23A231089
- Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 3.at n=46A240012
- Triangle, read by rows, T(n,k) = t(n-k, k) where t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), and f(x) = x + 3.at n=17A257180
- Triangle, read by rows, T(n,k) = t(n-k, k) where t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), and f(x) = x + 3.at n=18A257180
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 813", based on the 5-celled von Neumann neighborhood.at n=20A273640
- Number of partitions p of n that contain a proper partition of the maximal part of p.at n=34A279036
- Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*...*(1-x^10)).at n=27A288345
- Expansion of Product_{k>=2} (1 + x^Fibonacci(k))/(1 - x^Fibonacci(k)).at n=34A300414
- Numbers missing from A317415.at n=14A317417
- Number of series-reduced achiral free pure multifunctions (with empty expressions allowed) with one atom and n positions.at n=17A317884