12910
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23256
- Proper Divisor Sum (Aliquot Sum)
- 10346
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5160
- Möbius Function
- -1
- Radical
- 12910
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 107
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 90.at n=28A020429
- Values of A038007 not ending in 6 or 8.at n=24A038009
- Square array read by antidiagonals: T(n,k)=T(n,k-1)*n^2/(n-1)-Catalan(k-1) with a(n,1)=n-1 and a(1,k)=0 where Catalan(k)=C(2k,k)/(k+1)=A000108(k).at n=50A067346
- a(n) = prime(n) + prime(n^2).at n=38A092504
- Expansion of (1+sqrt(1-4*x))/(6*sqrt(1-4*x)-4).at n=5A104532
- a(n) = C(n,8) + C(n,7) + C(n,6) + C(n,5) + C(n,4) + C(n,3) + C(n,2) + C(n,1).at n=14A116690
- Number of n X 3 binary arrays whose sum with another n X 3 binary array containing no more than a single 1 has rows and columns in lexicographically nondecreasing order.at n=6A225895
- Number of nX7 binary arrays whose sum with another nX7 binary array containing no more than a single 1 has rows and columns in lexicographically nondecreasing order.at n=2A225899
- T(n,k)=Number of nXk binary arrays whose sum with another nXk binary array containing no more than a single 1 has rows and columns in lexicographically nondecreasing order.at n=38A225900
- T(n,k)=Number of nXk binary arrays whose sum with another nXk binary array containing no more than a single 1 has rows and columns in lexicographically nondecreasing order.at n=42A225900
- Total number of parts in all partitions of n^2 into squares.at n=9A229239
- Least positive integer k such that both k and k*n belong to the set {m>0: m+1, m^2+1 and m^2+prime(m)^2 are all prime}.at n=48A261339
- G.f. A(x) satisfies: A(x) = x + A( x*A(x) + x*A(x)^3 ).at n=11A271843
- Number of nX3 0..1 arrays with rows and columns in lexicographic nondecreasing order but with exactly three mistakes.at n=4A278380
- Number of nX5 0..1 arrays with rows and columns in lexicographic nondecreasing order but with exactly three mistakes.at n=2A278382
- T(n,k)=Number of nXk 0..1 arrays with rows and columns in lexicographic nondecreasing order but with exactly three mistakes.at n=23A278385
- T(n,k)=Number of nXk 0..1 arrays with rows and columns in lexicographic nondecreasing order but with exactly three mistakes.at n=25A278385
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n) - 1, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=16A295960
- a(n) = (-1)^(n-1) + Sum_{d|n, d>1} binomial(a(n/d) + d - 1, d).at n=59A305610
- Sum of the fifth largest parts in the partitions of n into 7 parts.at n=43A308929