8761
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
- 8762
- 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
- 8760
- Möbius Function
- -1
- Radical
- 8761
- 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
- 65
- 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
- 1093
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p == 1 (mod 4) where class number of Q(sqrt p) increases.at n=7A002142
- Primes p == 1 (mod 8), p = a^2 +64*b^2 such that y^2 = x^3 + p*x has rank 0.at n=41A007765
- Primes that remain prime through 3 iterations of function f(x) = 4x + 9.at n=23A023282
- n written in fractional base 9/8.at n=28A024656
- Numbers whose least quadratic nonresidue (A020649) is 17.at n=6A025026
- Lower prime of a difference of 18 between consecutive primes.at n=35A031936
- Number of compositions (ordered partitions) of n into distinct parts.at n=25A032020
- Denominators of continued fraction convergents to sqrt(793).at n=4A042529
- Numerators of continued fraction convergents to sqrt(888).at n=4A042716
- Sequence of 2 Pythagorean triangles, each with a leg and hypotenuse prime. The leg of the second triangle is the hypotenuse of the first.at n=32A048270
- Primes with distinct digits in descending order.at n=45A052014
- Primes p whose reciprocal has period (p-1)/10.at n=14A056215
- Let prime(i) = i-th prime, let twin(n) = (P,Q) be n-th pair of twin primes; sequence gives prime(Q).at n=39A057473
- Primes with 23 as smallest positive primitive root.at n=1A061335
- Primes which can be expressed as a sum of distinct powers of 3.at n=41A077717
- Smallest squarefree integer k such that Q(sqrt(k)) has class number n.at n=26A081363
- Smallest d such that real quadratic field with discriminant d has class number n.at n=26A081364
- "The partial sums of the positions where T occurs in this sentence are one, eight, twentyfive, fortynine, eightythree, onehundredtwentysix, ..." (Variation of Aronson's sequence).at n=41A089613
- A variation on Flavius's sieve (A000960): Start with the primes; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate.at n=36A099207
- Smallest prime factor of the concatenation of terms of the n-th row of the Stirling's number of the second kind.at n=12A100757