11129
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
- 4
- Divisor Sum
- 11520
- Proper Divisor Sum (Aliquot Sum)
- 391
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10740
- Möbius Function
- 1
- Radical
- 11129
- 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
- Denominators of continued fraction convergents to sqrt(702).at n=4A042351
- a(1) = 5, a(n) = concatenation of two closest factors of a(n-1) whose product equals a(n-1) or if a(n-1) is a prime then the concatenation of 1 and a(n-1).at n=6A063382
- (p^2-5)/4 for odd primes p.at n=45A074367
- Cycle of the inventory sequence (as in A063850) starting with n consists of prime numbers.at n=35A078970
- A nonsense sequence.at n=33A089075
- Smallest positive integer which can be expressed as the ordered sum of 3 squares in exactly n different ways.at n=46A124970
- a(n) = a(n-1) + a(floor(n/2)) + a(ceiling(n/2)).at n=30A131205
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 1100-1111 pattern in any orientation.at n=12A146230
- a(n) = Pell(n+3) - Jacobsthal(n+4).at n=9A166867
- Lexicographically earliest increasing sequence which lists the positions of the zero digits in the sequence.at n=22A167519
- Coefficient array of orthogonal polynomials P(n,x)=(x-n)*P(n-1,x)-(2n-3)*P(n-2,x), P(0,x)=1,P(1,x)=x-1.at n=40A178124
- Run length of the n-th run of Fibonacci composites.at n=24A182600
- Odd nonprimes n such that n+d+1 is prime for all divisors d of n.at n=26A187554
- Number of partitions of n having twice as many even parts as odd.at n=55A239004
- Number of partitions p of n such that (sum of parts with multiplicity 1) < (sum of all other parts).at n=37A240448
- Number of partitions p of n such that (sum of parts with multiplicity 1) <= (sum of all other parts).at n=37A240449
- Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 145", based on the 5-celled von Neumann neighborhood.at n=53A270286
- Number of quadrilateral regions in a "frame" of size n X n (see Comments in A331776 for definition), divided by 8.at n=21A332596
- a(n) = Sum_{k=0..n} (-1)^k * (3*k+1) * binomial(5*n-2*k+1,n-k)/(5*n-2*k+1).at n=6A390743