10961
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11172
- Proper Divisor Sum (Aliquot Sum)
- 211
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10752
- Möbius Function
- 1
- Radical
- 10961
- 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
- 42
- 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
- Pseudoprimes to base 18.at n=42A020146
- Matrix square of inverse triangle A096651; transforms n-dimensional partitions into (n-2)-dimensional partitions.at n=68A096875
- s(n) = floor(n^(n/5)/n!!!!!).at n=55A114869
- a(n) = n*(n^2 - 1)/2 - 1.at n=26A117560
- Composite numbers generated by the Euler polynomial x^2 + x + 41.at n=15A145292
- Numbers k such that continued fraction of (1 + sqrt(k))/2 has period 11.at n=41A146335
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 1), (0, 0, -1), (1, 0, 1), (1, 1, 0)}.at n=7A150747
- G.f.: A(x) = exp( Sum_{n>=1} sigma(n)^2*x^n/n ), a power series in x with integer coefficients.at n=12A156302
- Numbers n such that n-+1 are divisible by exactly 6 primes, counted with multiplicity.at n=8A157486
- Numerator of A166100(A166101(n))/A166102(n).at n=25A166272
- Number of (n+2) X 4 0..1 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..1 introduced in row major order.at n=17A204748
- Beach-Williams Pell numbers of type pq (p,q primes).at n=7A212078
- a(n) = 4*n^2 - 482*n + 14561.at n=8A213810
- Semiprimes generated by the Euler polynomial x^2 + x + 41.at n=15A228183
- Number of n X 2 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=21A239844
- Nonprimes such that it takes exactly 3 iterations of reverse-and-add digits to generate a prime.at n=20A245208
- Quasi-Carmichael numbers to exactly two bases.at n=24A257752
- Semiprimes whose prime factors are of equal binary length and which differ from each other in one bit position only.at n=18A261073
- Semiprimes whose prime factors differ from each other in one bit position only.at n=43A261077
- Semiprimes p*q such that q = p + 2^k for some k >= 0.at n=60A261078