9567
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 13832
- Proper Divisor Sum (Aliquot Sum)
- 4265
- 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
- 6372
- Möbius Function
- 0
- Radical
- 3189
- Omega Function (Ω)
- 3
- 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
- 78
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Numbers k that divide s(k), where s(1)=1, s(j)=7*s(j-1)+j.at n=41A014854
- Numbers k such that k divides s(k), where s(1)=1, s(j)= s(j-1) + j*7^(j-1).at n=23A014948
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = (primes).at n=24A024603
- Smaller of a pair of consecutive lucky numbers with a gap of 2n.at n=22A031884
- Pisot sequence L(8,9).at n=24A048590
- Number of partitions of n where n divides the product of the parts.at n=35A057568
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals 3n.at n=42A070899
- Indices of primes in sequence defined by A(0) = 29, A(n) = 10*A(n-1) - 41 for n > 0.at n=8A101960
- Number of different strings of length n+5 obtained from "123...n" by iteratively duplicating any substring.at n=10A137740
- Number of subsets of {1, 2, ..., n} such that no member is a sum of distinct other members.at n=19A151897
- Row sums of triangle A163772.at n=5A163775
- a(n) is number in A114994 which c-equivalent to c-factorial of n (A047778).at n=5A233568
- Length of the maximal prefix of noncomposite numbers on row n of A249821.at n=65A250473
- Number of (n+1) X (3+1) 0..1 arrays with every 2 X 2 subblock ne-sw antidiagonal difference nondecreasing horizontally and nw+se diagonal sum nondecreasing vertically.at n=7A258549
- Numbers that appear in both A278909 and A280967 but not in A280971.at n=34A280972
- Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section.at n=12A286782
- Column 1 of A286782.at n=3A287031
- a(n) is the greatest integer k such that k/Fibonacci(n) < sqrt(2).at n=20A293418
- a(n) is the integer k that minimizes |k/Fibonacci(n) - sqrt(2)|.at n=20A293420
- G.f.: Sum_{n>=0} x^n * (x^n + i)^n / (1 + i*x^(n+1))^(n+1), where i^2 = -1.at n=56A323675