9767
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 9768
- 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
- 9766
- Möbius Function
- -1
- Radical
- 9767
- 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
- 73
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1204
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 76.at n=26A020415
- a(n)-th prime is sum of first k primes for some k.at n=22A020641
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 97.at n=34A031595
- Upper prime of a difference of 18 between consecutive primes.at n=38A031937
- Primes with multiplicative persistence value 5.at n=24A046505
- Primes of the form 4*k^2 + 163.at n=41A057604
- Smallest prime of the form 10^k - prime(n), or 0 if no such prime exists.at n=50A090289
- Primes p such that 2^j+p^j are primes for j=0,1,4,16.at n=5A094492
- Primes with minimal digit = 6.at n=26A106106
- Primes having only {6, 7, 8, 9} as digits.at n=42A106111
- Primes p such that the polynomial x^4-x^3-x^2-x-1 mod p has 4 distinct zeros.at n=37A106280
- Primes with digit sum = 29.at n=26A106766
- Prime quartet leaders: largest number of a prime quartet.at n=26A119892
- Father primes of order 5.at n=35A136074
- Lesser of twin primes isolated from neighboring primes by +- 10 (or more).at n=15A138063
- Prime numbers k such that 8*k+1 and 8*k+3 are also primes.at n=38A139402
- Primes of the form 8x^2+231y^2.at n=37A140032
- Primes of the form 23x^2+4xy+68y^2.at n=38A140620
- Prime chain of 128 terms, including 104 distinct primes, consisting of the output of eight equations that alternate sequentially within a procedural expression of a single polynomial. The equations are either subsequences of x^2 - 79x + 1601 or transforms with one exception: 100x^2 - 2260x + 12959. The other four distinct equations are Euler-derived: 25x^2 - 1185x + 14083, 25x^2 - 775x + 6047, 100x^2 - 2280x + 13159, 100x^2 - 4160x + 43427.at n=17A140708
- An example of a simple prime-generating algorithm similar to Rowland's (A106108) that is a particular instance of a more general algorithm (see comments).at n=31A141537