9694
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
- 8
- Divisor Sum
- 15048
- Proper Divisor Sum (Aliquot Sum)
- 5354
- 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
- 4680
- Möbius Function
- -1
- Radical
- 9694
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 166
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 82.at n=25A020421
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (odd natural numbers).at n=29A025104
- a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == n (mod 3) so far).at n=37A060730
- Numbers k such that k*2^m+1 are composites for all exponents m in the range 0<=m<=k.at n=22A061153
- Potential Sierpiński numbers: integers for which the smallest m > 2^10 in A040076 such that n*2^m+1 is prime (A050921).at n=37A064721
- a(n) is the least k such that k*Mrs(n)*Mrs(n+1)*Mrs(n+2) + 1 is prime, where Mrs(n) is the n-th Mersenne prime.at n=19A082747
- Number of distinct nets for the n-hypercube.at n=3A091159
- Difference between the product of two consecutive primes and the next prime.at n=24A111071
- 3-almost primes with semiprime digits (digits 4, 6, 9 only).at n=26A111494
- a(n) = A011782(n) + A000219(n) - A000712(n).at n=14A116600
- Numbers whose trajectory under the Esucarys map ends at the fixed point 247.at n=11A129133
- Numbers k such that k and k^2 use only the digits 3, 4, 6, 7 and 9.at n=4A137128
- Maximal number of right triangles in n turns of Pythagoras's snail.at n=30A137515
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, 1, 0), (1, 0, -1), (1, 1, 1)}.at n=7A150619
- Number of partitions n such that the multiplicity of the number of odd parts is a part.at n=41A240541
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 379", based on the 5-celled von Neumann neighborhood.at n=23A271537
- Sum of the prime numbers in, but not on the border of, an n X n square array whose elements are the numbers from 1..n^2, listed in increasing order by rows.at n=18A344847
- Number of strict integer partitions of n with at least one neighborless part.at n=59A356607
- Viggo Brun's ternary continued fraction algorithm applied to { log 2, log 3/2, log 5/4 } produces a list of triples (p,q,r); sequence gives q values.at n=23A359743
- a(n) is the least positive integer k such that prime(n) + k divides the concatenation of prime(n) - 1 and prime(n).at n=49A385172