11409
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15216
- Proper Divisor Sum (Aliquot Sum)
- 3807
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7604
- Möbius Function
- 1
- Radical
- 11409
- 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
- 81
- 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
- no
- Odd
- yes
Appears in sequences
- Number of 3rd-order maximal independent sets in cycle graph.at n=43A007387
- First differences are A005563.at n=31A047732
- Centered 23-gonal numbers.at n=31A069174
- Structured disdyakis triacontahedral numbers (vertex structure 11).at n=8A100158
- Semiprimes in A056105.at n=27A113519
- a(n)=a(n-2)+a(n-5).at n=43A133394
- A007318 * A157019.at n=11A157029
- Number of arrays of n nonnegative integers with value i>0 appearing only after i-1 has appeared at least 4 times.at n=14A210541
- Numbers k such that anti-phi(k) = anti-phi(k+1).at n=45A241003
- Number of (n+2) X (3+2) 0..3 arrays with every 3 X 3 subblock row and column sum not equal to 0 2 5 6 or 7 and every 3 X 3 diagonal and antidiagonal sum equal to 0 2 5 6 or 7.at n=4A252418
- Number of (n+2)X(5+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 2 5 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 2 5 6 or 7.at n=2A252420
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 2 5 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 2 5 6 or 7.at n=23A252423
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 2 5 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 2 5 6 or 7.at n=25A252423
- Isolated deficient numbers that are divisible by 3.at n=20A273255
- Result of inserting the integers n = 0, 1, 2, ... in this order into an initially empty list, where n is inserted between the pair of consecutive elements with sum equal to n and minimal absolute difference, or at the end of the list if no such pair exists.at n=46A360447
- The n-th term of the sequence is the last term of n's trajectory under the "multiply with zero" rules explained in A365993.at n=25A365994
- Number of ways two dihexes can be placed on an n-th regular hexagonal board.at n=4A372855
- a(n) = floor(gamma^(-n)) where gamma is Euler's constant A001620.at n=17A390318