12914
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21168
- Proper Divisor Sum (Aliquot Sum)
- 8254
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5860
- Möbius Function
- -1
- Radical
- 12914
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 169
- 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
- yes
- Odd
- no
Appears in sequences
- a(1) = 1, a(2) = 2, a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-2)*a(2) for n >= 3.at n=10A014431
- Base 4 digits are, in order, the first n terms of the periodic sequence with initial period 3,0,2,1.at n=6A037765
- a(0) = 2 and, for n >= 1, rewrite 0->100 in the binary expansion of n and append 10 to the right.at n=38A080310
- Even elements of A085493.at n=28A106431
- Numbers such that A059248(k), the numerator of Sum_{i=1..k} 1/Fibonacci(i), is not equal to A250744(k), the denominator of the harmonic mean of the first k positive Fibonacci numbers.at n=5A247240
- Number of (n+2) X (1+2) 0..1 arrays with no 3 x 3 subblock diagonal sum 3 and no antidiagonal sum 3 and no row sum 0 and no column sum 0.at n=5A256741
- Number of (n+2)X(6+2) 0..1 arrays with no 3x3 subblock diagonal sum 3 and no antidiagonal sum 3 and no row sum 0 and no column sum 0.at n=0A256746
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 3 and no antidiagonal sum 3 and no row sum 0 and no column sum 0.at n=15A256748
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 3 and no antidiagonal sum 3 and no row sum 0 and no column sum 0.at n=20A256748
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 918", based on the 5-celled von Neumann neighborhood.at n=29A273748
- Numbers m such that there exists a j for which m = Sum_{k=1..j} (m mod k), where k runs through the largest j primes less than m.at n=30A274422
- G.f. satisfies A(x) = 1 + x * A(x)^2 * (1 - A(x) + A(x)^2 - A(x)^3 + A(x)^4).at n=6A370473
- Integers k equal to the sum over A000203(t) mod t, for some steps, starting with t = k and then using the result to feed the next calculation.at n=29A377001