9667
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11056
- Proper Divisor Sum (Aliquot Sum)
- 1389
- 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
- 8280
- Möbius Function
- 1
- Radical
- 9667
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = (d(n) - r(n))/5, where d = A026037 and r is the periodic sequence with fundamental period (1,2,0,2,0).at n=50A026039
- Numbers k such that 35*2^k+1 is prime.at n=22A032367
- Numbers n such that 243*2^n-1 is prime.at n=38A050880
- Consider all integer triples (i,j,k), j,k>0, with i^3=j^3+binomial(k+2,3), ordered by increasing i; sequence gives i values.at n=18A054234
- Number of 5k+4 primes (A030433) in range ]2^n,2^(n+1)].at n=18A095024
- a(n) = least k such that the remainder of 13^k divided by k is n.at n=19A127821
- Base-2 logarithm of (n-th even superperfect number divided by 2^n).at n=20A134712
- Beastly fax numbers: numbers containing the fax number of the Beast (667, one more than its regular number) in their decimal expansion.at n=19A138563
- Composite numbers n such that 8*n^2-2*n-1 divides the primitive part U(n) of Fibonacci(n).at n=20A159234
- a(0)=1, a(1)=7, a(n) = 42*a(n-2) - a(n-1).at n=5A165505
- a(n) = 13*n^2 + 7*n + 1.at n=26A168240
- Sum over the odd entries of the rows in the triangle Worpitzky(n, k)*Harmonic(k) (A176276).at n=6A176277
- Half the number of n X 3 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.at n=3A183578
- Half the number of nX4 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.at n=2A183579
- T(n,k)=Half the number of nXk 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.at n=17A183584
- T(n,k)=Half the number of nXk 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.at n=18A183584
- Number of times an even number is encountered, when going from (n+1)!-1 to n!-1 using the iterative process described in A219652.at n=7A219662
- Number of ways to reciprocally link elements of an n X 3 array either to themselves or to exactly two horizontal, diagonal or antidiagonal neighbors.at n=6A220720
- T(n,k)=Number of ways to reciprocally link elements of an nXk array either to themselves or to exactly two horizontal, diagonal or antidiagonal neighbors.at n=42A220725
- Number of ways to reciprocally link elements of an 7Xn array either to themselves or to exactly two horizontal, diagonal or antidiagonal neighbors.at n=2A220731