9737
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12096
- Proper Divisor Sum (Aliquot Sum)
- 2359
- 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
- 7632
- Möbius Function
- -1
- Radical
- 9737
- 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
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = 2*a(n-1) + 2*a(n-2) - 3*a(n-3), with a(0) = 2, a(1) = 5, a(2) = 12.at n=10A019485
- Numbers k such that 277*2^k-1 is prime.at n=13A050897
- Integer part of log(n!)^(1 + log(log(1 + n))).at n=26A062475
- Non-balanced numbers in A015771.at n=17A078549
- Diagonal sums of number array A082110.at n=12A082114
- Where records occur in A111390.at n=46A114111
- Number of partitions of n such that the least part occurs at least twice.at n=33A117989
- Triangular array read by rows: T(n,1) = T(n,n) = 1, T(n,k) = 3*T(n-1,k-1) + 2*T(n-1,k).at n=47A119725
- Number of ways to place n+3 queens and 3 pawns on an n X n board so that no two queens attack each other (symmetric solutions count only once).at n=11A129554
- a(n) = n*(6*n^2 + 15*n + 5)/2.at n=14A163833
- Numbers k such that 3^k - 16 is prime.at n=11A219039
- G.f. A(x) satisfies: A(x)^16 = A(x^2)^8 + 16*x.at n=5A228927
- Triangle read by rows: T(n,k) is the number of non-equivalent regular polygons with n+1 edges, one of which is rooted, which are dissected by non-intersecting diagonals into k regions, such that two such polygons are identified up to reflection along the rooted edge and twisting along the diagonals that does not affect the root edge (for 1 <= k <= n-1 and n >= 2).at n=51A232206
- Number of partitions of n such that m(greatest part) <= m(1), where m = multiplicity.at n=34A240077
- Number of length 3+3 0..n arrays with some disjoint pairs in every consecutive four terms having the same sum.at n=9A247535
- Number of length-4 0..n arrays with no repeated value differing from the previous repeated value by other than plus two or minus 1.at n=8A269641
- Number of aperiodic necklaces (Lyndon words) with k<=5 black beads and n-k white beads.at n=34A277629
- Expansion of Sum_{p prime, i>=2} x^(p^i)/(1 - x^(p^i)) / Product_{j>=1} (1 - x^j).at n=31A281611
- p-INVERT of A079977, where p(S) = 1 - S - S^2.at n=12A289845
- Number of canonical forms for separation coordinates on hyperspheres S_n, ordered by increasing number of independent continuous parameters.at n=48A295380