11378
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17070
- Proper Divisor Sum (Aliquot Sum)
- 5692
- 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
- 1
- Radical
- 11378
- 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
- 130
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = Sum_{k=0..n} (n-k+1)^k.at n=9A026898
- a(n) = T(n,n+1) + T(n,n+2) + ... + T(n,2n), T given by A027082.at n=8A027108
- Row sums of array in A055450.at n=7A055451
- Sums of groups in A075639.at n=15A075640
- a(n) = Sum_{i=1..n} binomial(i+1,2)^4.at n=3A085439
- a(n) = sigma_3(n) - sigma_2(n).at n=21A092349
- a(n) = 2*Fibonacci(n) + 8*Fibonacci(n-5).at n=14A101156
- Triangle, read by rows, where T(n,k) = Sum_{j=0..n-k-1} C(j+k,j)*T(n-1,j+k) for n>k>=0 with T(n,n)=1.at n=55A101494
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k UUDD's starting at level 0; here U=(1,1), D=(1,-1) (0<=k<=floor(n/2)).at n=37A114486
- a(n) = 9*n^2 - 8*n + 2.at n=36A154254
- Triangle interpolating the swinging factorial (A056040) restricted to even indices with its binomial transform. Same as interpolating bilateral Schroeder paths (A026375) with the central binomial coefficients (A000984).at n=30A163841
- a(n) is the smallest number whose English name has the letter "t" in the n-th position, or -1 if no such number exists.at n=37A164792
- a(n) is the smallest number whose English name has the letter "h" in the n-th position, or -1 if no such number exists.at n=36A164795
- Number T(n,k) of entries in the k-th cycles of all permutations of {1,2,..,n}; each cycle is written with the smallest element first and cycles are arranged in increasing order of their first elements.at n=51A185105
- Incorrect version of A122705.at n=6A185181
- a(n) = Sum_{k = 0..n} (k*(k+1)/2)^n.at n=4A249564
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 41", based on the 5-celled von Neumann neighborhood.at n=26A269874
- Numbers missing from A001032 despite satisfying the necessary congruence conditions (see comments).at n=25A274469
- Numbers missing from A134419 despite satisfying the necessary congruence conditions (see comments).at n=30A274471
- Number of entries in the seventh cycles of all permutations of [n].at n=3A285235