11203
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11880
- Proper Divisor Sum (Aliquot Sum)
- 677
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10528
- Möbius Function
- 1
- Radical
- 11203
- 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
- Numbers whose base-7 representation contains exactly four 4's.at n=19A043412
- Coefficients of monic primitive irreducible polynomials over GF(4) listed in lexicographic order.at n=32A058952
- Numbers n which are divisors of the number produced by concatenating (n-1), (n-2), ... (n-10) in that order.at n=10A088871
- Array, A(n, k) = ((n+2)^(k+1) + (k+1)*n*(n+1) - 1)/(n+1)^2, read by antidiagonals.at n=61A094250
- Expansion of g.f.: (1-5*x)/((1-6*x)*(1-x)^2).at n=6A094259
- 4-Smith numbers.at n=9A103125
- Row sums of triangle A105615.at n=5A105618
- Smallest number containing exactly n distinct numbers in its decimal representation.at n=12A120005
- A123896 sorted and duplicates removed.at n=39A123902
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (-1, 1, 1), (0, 0, -1), (1, 0, 0)}.at n=9A148703
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (-1, 0, 1), (0, 1, -1), (1, -1, 0), (1, 1, 0)}.at n=8A149372
- L.g.f.: Sum_{n>=1} a(n)*x^n/n = Sum_{n>=1} (1 + sigma(n)*x)^n * x^n/n.at n=7A159309
- Expansion of 1/(1 - x - x^8 - x^15 + x^16).at n=48A173925
- Number of nondecreasing arrangements of n+2 numbers in 0..3 with each number being the sum mod 4 of two others.at n=36A183906
- Number of permutations of [n] with a fixed point but no succession.at n=8A209326
- Number of 0..5 arrays of length n with each element unequal to at least one neighbor, with new values introduced in 0..5 order.at n=8A221456
- Partial sums of A169707.at n=30A253098
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 587", based on the 5-celled von Neumann neighborhood.at n=22A273079
- Number of integer partitions of n > 0 where the maximum part equals the length minus the number of distinct parts.at n=52A324518
- Number of permutations of length n whose powers all avoid the pattern 132.at n=14A326762