9637
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10080
- Proper Divisor Sum (Aliquot Sum)
- 443
- 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
- 9196
- Möbius Function
- 1
- Radical
- 9637
- 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
- 122
- 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
- Pseudoprimes to base 13.at n=27A020141
- Pseudoprimes to base 59.at n=38A020187
- Pseudoprimes to base 71.at n=41A020199
- Strong pseudoprimes to base 13.at n=5A020239
- Strong pseudoprimes to base 59.at n=14A020285
- Number of partitions satisfying (cn(0,5) <= cn(2,5) = cn(3,5) and cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5)).at n=47A036807
- Trajectory of 3 under map n->17n+1 if n odd, n->n/2 if n even.at n=24A037106
- Numbers whose base-4 representation contains exactly four 1's and three 2's.at n=25A045108
- Write 0, 1, 2, 3, 4, ... in a triangular spiral, then a(n) is the sequence found by reading the terms along the line from 0 in the direction 0, 7, ...at n=46A062725
- Expansion of 1/((1-x)^2*(1-x^2)^2*(1-x^3)*(1-x^4)^2*(1-x^5)).at n=23A069957
- Variant on Lucas numbers: a(n) = a(n-1) + 3*a(n-2) with a(0)=2 and a(1)=1.at n=11A075118
- Expansion of (1-x)^(-1)/(1+2*x+2*x^2-x^3).at n=19A077933
- Records in A007535.at n=28A098654
- Numbers k such that 13k = 6j^2 + 6j + 1.at n=22A106390
- A086892(11*n).at n=37A141460
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 5-point barb 1,1 1,2 2,2 2,3 3,2 in any orientation.at n=9A146137
- a(n) = 5*n^2 - n + 1.at n=44A172043
- Inverse permutation to A190128.at n=25A190129
- Number of n X n X n 0..6 triangular arrays with each element x equal to the number of its neighbors equal to 6,6,2,0,2,2,1 for x=0,1,2,3,4,5,6.at n=5A203109
- Fibonacci sequence beginning 11, 9.at n=15A206422