8941
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 8942
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8940
- Möbius Function
- -1
- Radical
- 8941
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 47
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1112
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Values of k at which the period of the continued fraction for sqrt(k) sets a new record.at n=48A013645
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 6.at n=29A031419
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 86 ones.at n=2A031854
- Value of D for incrementally largest values of minimal x satisfying Pell equation x^2-Dy^2=1.at n=32A033316
- Primes of the form k^2 + k + 11.at n=46A048059
- Primes such that the sum of the factorials of the digits is a perfect square.at n=26A052279
- Third term of weak prime quintets: p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1).at n=22A054825
- Smallest prime p == 5 mod 8 (A007521) and p > prime(n+2) such that p is a quadratic residue mod the first n odd primes 3, 5, 7, 11, ..., prime(n+1), and p is a quadratic non-residue mod prime(n+2).at n=7A096639
- Let [n] = {1,2,...,n}. Let G_n be the union of all closed line segments joining any two elements of [n] X [n] along a vertical or horizontal line, or along a line with slope +-1. Then a(n) = combined total of the number of (nondegenerate) triangles and rectangles for which all edges are subsets of G_n.at n=9A098921
- Largest prime which can be formed from digits of n^2, or 0, if no prime.at n=42A102600
- Smallest prime p such that the maximum run length of consecutive quadratic nonresidues modulo p is n.at n=22A129201
- Right truncatable primes in base 8 (written in decimal form).at n=47A129692
- Primes p for which the period of the continued fraction of sqrt(p) increases.at n=45A130272
- Numbers k such that k and k^2 use only the digits 1, 4, 7, 8 and 9.at n=10A137058
- Primes of the form x^2 + 1365*y^2.at n=20A139667
- Primes congruent to 9 mod 29.at n=37A141985
- Primes congruent to 13 mod 31.at n=42A142017
- Primes congruent to 24 mod 37.at n=30A142133
- Primes congruent to 3 mod 41.at n=29A142200
- Primes congruent to 40 mod 43.at n=22A142289