11381
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12000
- Proper Divisor Sum (Aliquot Sum)
- 619
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10764
- Möbius Function
- 1
- Radical
- 11381
- 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
- 68
- 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 connected graphs with one cycle of length 4.at n=10A000368
- Cube root of A030683.at n=32A030684
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 20.at n=24A050969
- a(n) = sum[i=1,n](i-th prime of Erdős-Selfridge classification i+). Cumulative sums of A101253.at n=5A098661
- a(1) = 668; for n > 1, a(n) = a(n-1) + 1 + sum of distinct prime factors of a(n-1) that are < a(n-1).at n=34A105212
- a(n) = (2*n^3 + 9*n^2 + n + 24) / 6.at n=31A160805
- Sequence starting with 1 such that the sum of any two distinct elements has four distinct prime factors.at n=4A181623
- a(0)=a(1)=1, a(n) = a(n-1) + a(a(n-2) mod n).at n=37A215525
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 302", based on the 5-celled von Neumann neighborhood.at n=32A271158
- Number of 2Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1, 3 or 4 neighboring 1s.at n=9A297750
- Difference between maximum and minimum sum of products of successive pairs in permutations of [n].at n=40A306262
- a(n) = 1 + Sum_{k=1..n-4} a(k) * a(n-k-4).at n=26A346076
- a(0) = 1; a(n) = Sum_{k=0..floor((n-1)/3)} binomial(n-1,3*k) * a(k).at n=16A352045
- Numbers k such that A361338(k) = 8.at n=34A361347
- Number of subsets of {1..n} whose greatest element can be written as a (strictly) positive linear combination of the others.at n=31A365043
- a(n) = sum for all integer partitions of n of the number of distinct multiplicities in each partition.at n=28A373271
- Antidiagonal sums of A342819.at n=40A377375