11374
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 19152
- Proper Divisor Sum (Aliquot Sum)
- 7778
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5060
- Möbius Function
- 0
- Radical
- 1034
- Omega Function (Ω)
- 4
- 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
- 174
- 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
- Number of colors that can be mixed with up to n units of yellow, blue, red.at n=42A048134
- The (10^n)-th composite number.at n=4A065857
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=3, r=3, I={-1,0,1,2}.at n=41A079982
- Numbers j such that (3^j)*(47#) -1 is prime.at n=38A110116
- Least multiple of n such that every partial concatenation followed by a 3 is prime.at n=46A111437
- Sum of all primes from n-th prime to (2*n-1)-th prime.at n=39A161463
- a(n) is the smallest number whose English name has the letter "f" in the n-th position, or -1 if no such number exists.at n=33A164794
- a(n) is the smallest number whose English name has the letter "r" in the n-th position, or -1 if no such number exists.at n=36A164796
- a(n) is the smallest number whose English name has the letter "u" in the n-th position, or -1 if no such number exists.at n=35A164797
- a(n) = 94*n^2.at n=11A174337
- n^2 + {1,3,7} are primes.at n=34A182238
- Triangle T(n,k) of the coefficients [x^n] x^k*(x^5+3*x^4+4*x^3+3*x^2+2*x+1)^k, 1<=k<=n.at n=71A186686
- Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, four, five, six or seven distinct values for every i,j,k<=n.at n=4A211743
- Length of binary representation of Fibonacci(2^n).at n=14A215422
- Number of (n+2) X (5+2) 0..1 arrays with no 3 x 3 subblock diagonal sum 1 and no antidiagonal sum 2 and no row sum 0 and no column sum 3.at n=22A255798
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 78", based on the 5-celled von Neumann neighborhood.at n=34A270093
- Numbers n such that the sum of the digits of the numbers from 1 to n divides the sum of the numbers from 1 to n.at n=21A272360
- Even numbers n such that A048633(n+1) = A048633(n).at n=42A331586
- Triangle read by rows: T(n,k) is the number of unlabeled simple 3-connected graphs with n nodes and k edges (n >= 4, ceiling(3*n/2) <= k <= n*(n-1)/2).at n=47A339072
- Starts of runs of 3 consecutive numbers whose powerful part is larger than their powerfree part (A328014).at n=3A348120