9705
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15552
- Proper Divisor Sum (Aliquot Sum)
- 5847
- 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
- 5168
- Möbius Function
- -1
- Radical
- 9705
- 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
- 179
- 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
- no
- Odd
- yes
Appears in sequences
- Number of f-vectors for simplicial complexes of dimension at most 3 on at most n-1 vertices.at n=8A011828
- f-vectors for 3-neighborly simplicial complexes on n+2 vertices.at n=5A011835
- Number of partitions of n into parts 3k or 3k+1.at n=48A035360
- First element of first run of exactly n consecutive numbers not of form x^2+y^2.at n=15A104271
- Where records occur in A111390.at n=30A114111
- Start with 1 and repeatedly reverse the digits and add 68 to get the next term.at n=49A118215
- Table T(n,k) by antidiagonals. T(n,k) is the number of primitive (=aperiodic) k-ary words with length less than or equal to n (n,k >= 1).at n=52A143326
- Products of 3 distinct primes whose binary expansion is palindromic.at n=38A168355
- Partial sums of floor(4^n/9).at n=8A178744
- Expansion of 1/(1 - x - x^2 - x^6 + x^8).at n=19A225391
- Number of second differences of arrays of length n + 2 of numbers in 0..4.at n=3A228214
- T(n,k)=Number of second differences of arrays of length n+2 of numbers in 0..k.at n=24A228218
- Number of second differences of arrays of length 6 of numbers in 0..n.at n=3A228221
- Triangle read by rows: a non-Riordan array serving as a counterexample to a conjecture about Riordan arrays.at n=40A235608
- Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) is not a part of p.at n=35A241736
- Number of (n+2)X(n+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 3 5 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 3 5 6 or 7.at n=16A252246
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 606", based on the 5-celled von Neumann neighborhood.at n=28A273206
- G.f.: Product_{k>=1} (1 + x^(k^3)) / (1 - x^k).at n=29A280278
- Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 541", based on the 5-celled von Neumann neighborhood.at n=14A282987
- Sum of the fifth largest parts of the partitions of n into 8 squarefree parts.at n=54A326448