9629
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 9630
- 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
- 9628
- Möbius Function
- -1
- Radical
- 9629
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1189
- 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 97.at n=1A020436
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 39.at n=0A031627
- Primes p such that x^29 = 2 has no solution mod p.at n=40A059256
- Primes starting and ending with 9.at n=16A062335
- Define the composite field of a prime q to be f(q) = (t,s) if p, q, r are three consecutive primes and q-p = t and r-q = s. This is a sequence of primes q with field (6,2).at n=47A073651
- Balanced primes of order two.at n=44A082077
- Smallest member of a pair of consecutive twin prime pairs that have three primes between them.at n=15A089635
- Logarithmic integral approximation to number of primes less than 10^x.at n=4A089896
- 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=38A099207
- Numbers n such that (6^n-1)^2-2 is prime.at n=14A100901
- Primes p = prime(k) such that both p+2 and prime(k+6)-2 are prime numbers.at n=28A105413
- Primes p such that the polynomial x^4-x^3-x^2-x-1 mod p has 4 distinct zeros.at n=36A106280
- Primes that do not divide any term of the Lucas 4-step sequence A073817.at n=8A106300
- Primes p such that p + 2 and p*(p + 2) + 2 are primes.at n=23A108013
- a(n) is the least k, not multiple of 10, such that k^k contains a palindromic substring of length n.at n=18A115943
- a(n) is the least k, not multiple of 10, such that k^k contains a palindromic substring of length n.at n=16A115943
- a(n) is the least k, not multiple of 10, such that k^k contains a palindromic substring of length n.at n=20A115943
- Larger of two consecutive Sophie Germain primes with the same digital sum.at n=22A118507
- Quotients A128356(n)/prime(n).at n=9A128357
- Quotients A128452(p+1)/p for prime p = A000040(n).at n=9A128456