12706
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19062
- Proper Divisor Sum (Aliquot Sum)
- 6356
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6352
- Möbius Function
- 1
- Radical
- 12706
- 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
- 55
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = position of 3*n^3 in A003072.at n=33A024970
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 3 (mod 4).at n=45A035548
- Semiprimes which are the sum of three distinct positive cubes in two or more distinct ways.at n=13A180089
- G.f. satisfies: A(x) = Product_{n>=1} (1 + x^n)*(1 + x^(2*n)*A(x)^2).at n=11A192785
- Beach-Williams Pell numbers of type 2p (p prime).at n=9A212074
- Number of (n+1) X (3+1) 0..1 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=5A250792
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=33A250797
- Number of (6+1)X(n+1) 0..1 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=2A250803
- Least positive integer k such that prime(k*n)+2 = prime(i*n)*prime(j*n) for some 0 < i < j.at n=21A257926
- Number of terms of A072873 less than or equal to 10^n.at n=36A267757
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 22", based on the 5-celled von Neumann neighborhood.at n=39A269717
- G.f.: Product_{k>=1} (1 + x^(k*(k+1))) / (1 - x^k).at n=30A280423
- Trajectory of 48 under the map x -> A289667(x).at n=5A290350
- Numbers k such that (77*10^k - 59)/9 is prime.at n=20A294489
- Number of nX6 0..1 arrays with every element equal to 1, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=18A298922
- Row sums of A325433.at n=39A325434
- Square array T(n,k), n >= 1, k >= 2, read by antidiagonals, where T(n,k) is the number of self-avoiding walks in the n X k grid graph which start at any of the n vertices on left side of the graph and terminate at any of the n vertices on the right side.at n=24A333509
- Expansion of Product_{i>=1, j>=0} (1 + x^(i * 6^j)).at n=54A373220
- Coefficient of x^n in the expansion of ((1+x) * (1+x^4))^n.at n=11A387125
- Number of matchings in the n-dipyramidal graph.at n=12A387570