9687
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12920
- Proper Divisor Sum (Aliquot Sum)
- 3233
- 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
- 6456
- Möbius Function
- 1
- Radical
- 9687
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 166
- 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
- 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 64.at n=39A031562
- Number of binary rooted trees with n nodes and height exactly 10.at n=17A036599
- Integers n > 7059 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 7059.at n=27A063058
- Where records occur in A111390.at n=21A114111
- Number of equicolorable rooted trees on 2n nodes.at n=6A119855
- Numbers k such that k and k^2 use only the digits 3, 6, 7, 8 and 9.at n=15A137137
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, 0), (-1, 1), (0, 1), (1, -1)}.at n=11A151401
- a(n) = A000043(n)-2.at n=20A153798
- Inverse permutation to A190132.at n=9A190133
- Numbers k such that 9^k - 10 is prime.at n=19A217493
- Number of strict partitions of 2n having an ordering of the parts in which no two neighboring parts have the same parity.at n=33A239882
- Least positive integer k such that k*n+1 = prime(p) and k^2*n+1 = prime(q) for some pair of primes p and q.at n=37A261437
- Integers of the form Sum_{k=1..m} d(k), where d(k) is the decimal fraction 0.k (e.g. d(999)=0.999).at n=7A275623
- Expansion of Product_{k>=1} (1 + x^k)^(k*(k+1)*(2*k+1)/6).at n=9A281156
- Expansion of Sum_{i>=1} i*x^i/(1 - x) * Product_{j=1..i} 1/(1 - x^j).at n=18A284870
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 358", based on the 5-celled von Neumann neighborhood.at n=44A287784
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 358", based on the 5-celled von Neumann neighborhood.at n=45A287784
- Number of integer partitions of n with at least two but not all parts having a common divisor greater than 1.at n=32A303139
- Numbers k such that 339*2^k+1 is prime.at n=23A322962
- Triangle read by rows: T(n, k) = Sum_{i=1..n-k} qStirling1(n-k, i) * qStirling2(n-1+i, n-1) for 0 < k < n with initial values T(n, 0) = 0^n and T(n, n) = 1 for n >= 0, here q = 2.at n=33A355282