9691
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10584
- Proper Divisor Sum (Aliquot Sum)
- 893
- 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
- 8800
- Möbius Function
- 1
- Radical
- 9691
- 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
- 60
- 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
- Weighted count of partitions with distinct parts.at n=34A005895
- 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 97.at n=27A031595
- Composite numbers whose prime factors contain no digits other than 1 and 8.at n=4A036308
- Numbers whose concatenation of prime factors (with multiplicity) is a square.at n=27A038693
- Semiprimes in A056106.at n=20A113524
- Where records occur in A111390.at n=23A114111
- Number of distinct solutions of Sum_{i=1..2}(x(2i-1)*x(2i)) = 0 (mod n), with x() only in 2..n-2.at n=39A180814
- Principal diagonal of the convolution array A213762.at n=8A213763
- Semiprimes p such that next semiprime after p is p + 10.at n=36A217030
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 5 6 or 7.at n=36A252679
- Number of (1+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 5 6 or 7.at n=8A252680
- G.f. A(x) satisfies: A( A(x)^2 - A(x)^3 ) = x*A(x).at n=11A268655
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 926", based on the 5-celled von Neumann neighborhood.at n=26A273778
- Number of integers in n-th generation of tree T(-3/4) defined in Comments.at n=41A274151
- Partial sums of icosahedral numbers (A006564).at n=10A302560
- Number of compositions (ordered partitions) of n into distinct odd squarefree parts.at n=55A331982
- Odd composite integers m such that A004187(2*m-J(m,45)) == J(m,45) (mod m) and gcd(m,45)=1, where J(m,45) is the Jacobi symbol.at n=25A340124
- Numbers k that have the same set of digits in base 10 as primepi(k).at n=35A355418
- Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - x - x^2.at n=41A367208
- Non-palindromic numbers m such that m * repunit of length k is palindromic for all large enough k.at n=41A370053