12670
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
- 16
- Divisor Sum
- 26208
- Proper Divisor Sum (Aliquot Sum)
- 13538
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- yes
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- 1
- Radical
- 12670
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 156
- 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
- Weird numbers: abundant (A005101) but not pseudoperfect (A005835).at n=15A006037
- Numbers with exactly 4 distinct palindromic prime factors.at n=29A046402
- Unitary weird numbers: unitary abundant (A034683) but not unitary pseudoperfect (A293188).at n=12A064114
- a(n) = the multiple of n which is > (sum{k=1 to n-1} a(k)) and is <= (n + sum{k=1 to n-1} a(k)).at n=13A128020
- a(n) = numerator of constant lambda(n) involved in a recurrence for the Atkin polynomials A_k(j).at n=29A145226
- Number of subsets of {1..n} (including empty set) such that the pairwise sums of distinct elements are all distinct.at n=19A196723
- Smallest number k such that k*n +/- 1, k*n^2 +/- 1, and k*n^3 +/- 1 are three sets of twin primes. a(n) = 0 if no such number exists.at n=11A239021
- Number of (n+1)X(1+1) 0..3 arrays with every 2X2 subblock summing to a prime and those sums nondecreasing in every row and column.at n=3A251475
- Number of (n+1)X(4+1) 0..3 arrays with every 2X2 subblock summing to a prime and those sums nondecreasing in every row and column.at n=0A251478
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock summing to a prime and those sums nondecreasing in every row and column.at n=6A251481
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock summing to a prime and those sums nondecreasing in every row and column.at n=9A251481
- Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 3 5 6 or 8 and every 3X3 diagonal and antidiagonal sum equal to 0 3 5 6 or 8.at n=6A252345
- Number of (n+2)X(7+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 3 5 6 or 8 and every 3X3 diagonal and antidiagonal sum equal to 0 3 5 6 or 8.at n=0A252351
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 3 5 6 or 8 and every 3X3 diagonal and antidiagonal sum equal to 0 3 5 6 or 8.at n=21A252352
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 3 5 6 or 8 and every 3X3 diagonal and antidiagonal sum equal to 0 3 5 6 or 8.at n=27A252352
- Expansion of Product_{k>=1} (1 + x^(2*k-1))^k.at n=36A263140
- Triangle read by rows: T(n, k) = Sum_{t=k..n-2} (-1)^(t-k)*(n-t)!*binomial(t,k)*binomial(n-2,t).at n=31A264027
- a(n) = 15*binomial(n,6)-6*binomial(n-2,4)+binomial(n-4,4).at n=8A274311
- Bi-unitary weird numbers: bi-unitary abundant numbers (A292982) that are not bi-unitary pseudoperfect (A292985).at n=17A292986
- Number of ways to choose a partition, with odd parts, of each part of a partition of n into odd parts.at n=24A300301