11192
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
- 8
- Divisor Sum
- 21000
- Proper Divisor Sum (Aliquot Sum)
- 9808
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5592
- Möbius Function
- 0
- Radical
- 2798
- 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
- no
- 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
- Numbers that are the sum of 8 positive 7th powers.at n=37A003375
- Number of partitions of n into parts not of the form 21k, 21k+9 or 21k-9. Also number of partitions with at most 8 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=34A035987
- Cycle of the inventory sequence (as in A063850) starting with n consists of prime numbers.at n=36A078970
- Numbers k such that 216*k+108 is a term of A097703 and A007494 and A098240.at n=10A098241
- Number of triples (i,j,k) with 1 <= i <= j < k <= n and gcd{i,j,k} = 1.at n=42A100448
- G.f. satisfies A(x) = x*(1+A^2)^2/(1-A+A^2).at n=10A101490
- a(n) = 6 + floor( Sum_{j=1..n-1} a(j)/4 ).at n=34A120164
- Number of cribbage hands with score n.at n=17A143133
- a(n) = 361*n + 1.at n=30A158310
- Number of strings of numbers x(i=1..6) in 0..n with sum i*x(i)^3 equal to 6*n^3.at n=42A184723
- Number of partitions of n such that 2*(greatest part) < (number of parts).at n=43A237751
- Number of partitions p of n such that (number of numbers in p that have multiplicity 1) = (number of numbers in p having multiplicity > 1).at n=43A241274
- Partial sums of A243980.at n=20A244050
- a(n) = 31*n^2 + 1.at n=19A247155
- Numbers k such that (14*10^k - 143)/3 is prime.at n=19A279050
- Sum of the even parts in the partitions of n into 6 parts.at n=32A309552
- a(n) gives the number of squares in the n-th iteration of the Harter-Heighway dragon.at n=12A339739
- Dirichlet convolution of A276086 (primorial base exp-function) with A055615 (Dirichlet inverse of n).at n=28A383286