11869
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14112
- Proper Divisor Sum (Aliquot Sum)
- 2243
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9840
- Möbius Function
- -1
- Radical
- 11869
- Omega Function (Ω)
- 3
- 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
- 143
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Expansion of 1/((1-2*x)*(1-6*x)*(1-7*x)).at n=4A016304
- Numbers k such that the continued fraction for sqrt(k) has period 98.at n=12A020437
- Number of partitions of n into parts not of the form 11k, 11k+4 or 11k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 4 are greater than 1.at n=40A035947
- Number of partitions satisfying cn(2,5) + cn(3,5) <= cn(1,5) + cn(4,5).at n=35A039895
- Numbers whose base-5 representation contains exactly three 3's and three 4's.at n=2A045307
- Numbers k such that k divides sum of first k primes A007504(k).at n=4A045345
- Difference between n-th prime squared and n-th perfect square.at n=29A106588
- Numbers k that divide the square of the sum of the first k primes.at n=7A111452
- Number of primitive multiplex juggling sequences of length n, base state <3> and hand capacity 3.at n=6A136784
- 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, 0), (-1, 0, 1), (-1, 1, -1), (1, -1, -1), (1, 1, 1)}.at n=8A149525
- Column 1 of matrix square of triangle A152400; also, column 3 of square array A152405.at n=5A152404
- Square array, read by antidiagonals, where row n+1 is generated from row n by first removing terms in row n at positions {m*(m+1)/2, m>=0} and then taking partial sums, starting with all 1's in row 0.at n=39A152405
- Maximum number of partitions of n into exactly k parts, each <= k. a(n) is maximum in each row of A157044.at n=51A157046
- a(n) = n*(2*n^2 + 5*n + 1)/2.at n=21A162254
- a(n) = a(n-1) + 12*n for n > 1; a(1) = 1.at n=43A166873
- The number of primes of the form i^2 + j^4 (A028916) <= 2^n, counted with multiplicity.at n=22A226496
- Number of n X 4 binary arrays with rows lexicographically nondecreasing and columns lexicographically nondecreasing and row sums nondecreasing and column sums nonincreasing.at n=9A266931
- a(n) = n*(6*n^2 - 8*n + 3).at n=13A272378
- Number of nX5 0..1 arrays with every element unequal to 0, 1, 3, 4, 7 or 8 king-move adjacent elements, with upper left element zero.at n=8A316549
- Indices of primes followed by a gap (distance to next larger prime) of 32.at n=41A320714