9967
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 31
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 9968
- 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
- 9966
- Möbius Function
- -1
- Radical
- 9967
- 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
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1228
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = 5*a(n-2) - 2*a(n-4), with initial terms 0,1,1,3.at n=14A005824
- Primes that remain prime through 3 iterations of function f(x) = 2x + 3.at n=21A023273
- 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 99.at n=15A031597
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 56 ones.at n=18A031824
- Number of partitions of n into parts not of the form 25k, 25k+9 or 25k-9. Also number of partitions with at most 8 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=34A036008
- Primes p from A031924 such that A052180(primepi(p)) = 13.at n=16A052233
- Least prime in A031924 (lesser of 6-twins) such that the distance to the next 6-twin is 2*n.at n=44A052352
- Expansion of 1/(1-x+2*x^2+2*x^3).at n=17A077956
- Rounded base-2 logarithm of A082128(n).at n=26A082129
- Largest n-digit member of A087593. Define dd(k) = the number formed by concatenating the absolute difference of successive digits of k. Sequence contains largest n-digit prime p such that dd(p) is also prime.at n=2A087596
- a(n) = largest prime using least number of possible digits with a digit sum n, or 0 if no such number exists. E.g., if n > 9 and there are no two-digit primes with a given digit sum n then three-digit numbers are explored and so on.at n=30A088115
- p(k) such that 2*p(k)+3 and 2*p(k+1) + 3 are consecutive primes, where p(i) denotes the i-th prime.at n=39A089527
- Reverse digits of largest primes, append to sequence if result is larger prime then previous one with reverse digits.at n=19A098922
- Primes of the form 47*k + 3.at n=28A100494
- Primes with minimal digit = 6.at n=28A106106
- Primes p such that the polynomial x^4-x^3-x^2-x-1 mod p has 4 distinct zeros.at n=39A106280
- Primes with digit sum = 31.at n=15A106767
- a(n) = 5*a(n-1) - 2*a(n-2); a(0)=1, a(1)=5.at n=6A107839
- a(n) = 5*a(n-2) - 2*a(n-4), n >= 4.at n=12A109165
- Largest n-digit prime whose digit reversal is also prime.at n=3A114019