11384
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21360
- Proper Divisor Sum (Aliquot Sum)
- 9976
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5688
- Möbius Function
- 0
- Radical
- 2846
- Omega Function (Ω)
- 4
- 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
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- Expansion of 1/(1-x^5-x^6-x^7-x^8-x^9-x^10-x^11-x^12-x^13).at n=42A017844
- Expansion of sum ( q^n / product( 1-q^k, k=1..3*n), n=0..inf ).at n=29A035295
- Positions of 4-digit terms in the continued fraction for Pi (3 is at position 0).at n=9A048959
- Binary widths of the terms of A072654.at n=15A072655
- E.g.f. exp(sum_{d|M} (exp(d*x)-1)/d), M=14.at n=4A141010
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having exactly k entries that are midpoints of 321 patterns (0 <= k <= n-2 for n >= 2; k=0 for n=1).at n=25A145879
- Number of 5 X 5 arrays of squares of integers, symmetric about main diagonal, with all rows summing to n.at n=34A156385
- Number of n X n arrays of squares of integers, symmetric about main diagonal, with all rows summing to 34.at n=3A156495
- Number of -6..6 arrays x(0..n+1) of n+2 elements with zero sum and no two neighbors summing to zero.at n=2A199830
- T(n,k)=Number of -k..k arrays x(0..n+1) of n+2 elements with zero sum and no two neighbors summing to zero.at n=30A199832
- Number of -n..n arrays x(0..4) of 5 elements with zero sum and no two neighbors summing to zero.at n=5A199834
- Triangle T(n,k), read by rows, given by (1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...) DELTA (0, 0, 1, 1, 2, 2, 3, 3, 4, 4, ...) where DELTA is the operator defined in A084938.at n=39A202992
- Number of 4-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero with no three beads in a row equal.at n=24A209345
- a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1, 2] as of [3, 1, 3].at n=9A211296
- a(0)=a(1)=1, a(n) = a(n-1) + a(a(n-2) mod n).at n=38A215525
- Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and column sum nonprime and every diagonal and antidiagonal sum prime.at n=9A251838
- Partial sums of A256970.at n=27A256971
- Triangle read by rows: T(n,k) = number of k-classes of permutations of n letters avoiding the pattern 132 (n>=1, 0 <= k <= n-1).at n=50A261665
- Least k such that prime(n) is the smallest prime p for which k^2 + p^2 is also prime, or 0 if none.at n=49A263466
- Consecutive internal states of the linear congruential pseudo-random number generator (171*s + 11213) mod 53125 when started at 1.at n=1A385039