11188
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 19586
- Proper Divisor Sum (Aliquot Sum)
- 8398
- 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
- 5594
- Omega Function (Ω)
- 3
- 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
- Number of P-graphs with 2n edges.at n=12A007165
- Bessel function |Y_0(n)| is a monotonically decreasing positive sequence.at n=41A046963
- a(n) = C(2n-1,n-1) mod n^3.at n=26A099907
- Row sums of triangle A100326, in which row n equals the inverse binomial of column n of square array A100324.at n=6A100327
- Rectangular table, read by antidiagonals, such that the o.g.f. of row n, R_n(y), satisfies: R_n(y) = Sum_{k>=0} y^k * R_k(y)^n for n>=0, with R_0(y) = 1/(1-y).at n=62A124460
- Row 3 of rectangular table A124460.at n=7A124463
- Numbers k such that binomial(3k, k) - 1 is prime.at n=23A125220
- The sums of pairs of adjacent terms are the odd palindromic primes in ascending order.at n=30A181882
- Number of strings of numbers x(i=1..5) in 0..n with sum i*x(i) equal to n*5.at n=16A184705
- Numbers consisting of ones and eights.at n=33A213084
- a(n) = binomial(2*c-1, c-1) (mod c^3), where c is the n-th composite.at n=16A244214
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 569", based on the 5-celled von Neumann neighborhood.at n=21A272993
- Number of compositions (ordered partitions) of n into multiplicatively perfect numbers (A007422).at n=32A282569
- Compound filter: a(n) = P(A061395(n), A286465(n)), where P(n,k) is sequence A000027 used as a pairing function.at n=40A286453
- Numbers that contain exactly one pair of identical digits x and a triple of identical digits y (x not equal y).at n=16A291312
- Total number of binary digits in all partitions of n into distinct parts.at n=36A319140
- Number of nonnegative solutions to (x_1)^2 + (x_2)^2 + ... + (x_6)^2 <= n.at n=38A341401
- Numbers with digits in nondecreasing order whose digit sum is prime and whose digit product is a perfect square > 0.at n=38A344842
- Numbers that are the sum of eight fourth powers in exactly six ways.at n=32A345838
- Fourth Lie-Betti number of a path graph on n vertices.at n=19A362007