9689
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 32
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 9690
- 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
- 9688
- Möbius Function
- -1
- Radical
- 9689
- 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
- yes
- 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
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1196
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Mersenne exponents: primes p such that 2^p - 1 is prime. Then 2^p - 1 is called a Mersenne prime.at n=20A000043
- Degrees of primitive irreducible trinomials: n such that 2^n - 1 is a Mersenne prime and x^n + x^k + 1 is a primitive irreducible polynomial over GF(2) for some k with 0 < k < n.at n=14A001153
- Numbers such that ten iterations of Reverse and Add are needed to reach a palindrome.at n=9A015991
- From George Gilbert's marks problem: jumping 3 marks at a time (initial positions).at n=19A019592
- Primes whose digits are composite; primes having only {4, 6, 8, 9} as digits.at n=20A051416
- Primes having only {0, 6, 8, 9} as digits.at n=15A053580
- a(1)=5, a(n) is the smallest prime dividing 4*Q^2 + 1 where Q is the product of all previous terms in the sequence.at n=27A057207
- Numbers k such that k^2 + k + 1, k^3 + k + 1 and k^4 + k + 1 are all prime.at n=32A057683
- Primes having only 0,4,6,8,9 as digits.at n=32A061372
- Sum of digits = 8 times number of digits.at n=35A061425
- A B_2 sequence: a(n) is the smallest prime such that the pairwise sums of distinct elements are all distinct.at n=46A062294
- Primes starting and ending with 9.at n=19A062335
- Numbers which need ten 'Reverse and Add' steps to reach a palindrome.at n=9A065215
- Mersenne prime exponents (A000043) which are also Sophie Germain primes (A005384).at n=4A065406
- Primes that are a sum of twin primes and their indices.at n=34A088187
- Primes p such that both the digit sum of p plus p and the digit product of p plus p are also primes.at n=35A092529
- Primes p such that 2*p+1 and ((2*p+1)^2 + 1)/2 = p^2 + (p+1)^2 are primes.at n=17A098717
- Bisection of A000043.at n=10A099982
- Primes with minimal digit = 6.at n=24A106106
- Primes having only {6, 7, 8, 9} as digits.at n=40A106111