12179
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12840
- Proper Divisor Sum (Aliquot Sum)
- 661
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11520
- Möbius Function
- 1
- Radical
- 12179
- 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
- 63
- 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
- Convolution of natural numbers >= 2 and natural numbers >= 3.at n=37A023545
- [ exp(15/17)*n! ].at n=6A030885
- Frobenius number of the numerical semigroup generated by consecutive octahedral numbers.at n=3A069764
- a(n) = n*(n^2 - 1)/2 - 1.at n=27A117560
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 0100-0100-1111-0010-0010 pattern in any orientation.at n=13A147341
- Potential magic constants of 9 X 9 magic squares composed of consecutive primes.at n=17A191679
- Define sequence x(n) by x(1)=1, thereafter x(n) = (x(n-1)+n)/(1-n*x(n-1)); sequence gives denominator(x(n)).at n=12A220447
- Number of espalier polycubes of a given volume in dimension 3.at n=28A229915
- Number of (n+2)X(4+2) 0..2 arrays with no element unequal to a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=6A231223
- Number of (n+2)X(7+2) 0..2 arrays with no element unequal to a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=3A231226
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with no element unequal to a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=48A231227
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with no element unequal to a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=51A231227
- Number of partitions n such that the multiplicity of the number of even parts is a part.at n=40A240540
- a(n) = Fibonacci(n) + n*Lucas(n).at n=14A258321
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 547", based on the 5-celled von Neumann neighborhood.at n=22A272840
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 597", based on the 5-celled von Neumann neighborhood.at n=22A273146
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 705", based on the 5-celled von Neumann neighborhood.at n=20A273419
- G.f.: 1/(1 + x/(1 + 2*x^2/(1 + 3*x^3/(1 + 4*x^4/(1 + 5*x^5/(1 + 6*x^6/(1 + ... ))))))), a continued fraction.at n=33A285409
- Infinite sum of the odd numbers, compacted (see the Comments line for an explanation).at n=52A337097