9761
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10032
- Proper Divisor Sum (Aliquot Sum)
- 271
- 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
- 9492
- Möbius Function
- 1
- Radical
- 9761
- 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
- 47
- 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
- a(n) = Sum_{m=1..n} Sum_{k=1..m} prime(k).at n=25A014148
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+2)/m < s for some integer k.at n=42A024842
- Numbers n such that 99*2^n-1 is prime.at n=28A050575
- a(n) = 6*n^2 + 4*n + 1.at n=40A080859
- Diagonal sums of symmetric triangle A108350.at n=17A108351
- Numbers whose Matula tree is a binary tree (i.e., root has degree 2 and all nodes except root and leaves have degree 3).at n=12A111299
- Triangle T(n, k) = k^2*(1+n)^2 - 4*n, read by rows.at n=64A123961
- a(n) = 15*n*(n+1) + 11.at n=25A132208
- Positions of partition numbers in the EKG sequence.at n=32A159032
- a(n) = 3*A022004(n) + 8.at n=29A163635
- Increasing sequence generated by these rules: a(1)=1, and if x is in a then 3x-1 and x^2 are in a.at n=53A191289
- Numbers k such that 6k+1, 12k+1, 18k+1 and 36k+1 are all primes.at n=41A206024
- Row lengths of table A174382.at n=26A240508
- Triangle read by rows: row n>=1 contains in increasing order the Matula numbers of the rooted binary trees with n leaves.at n=14A245824
- Number of length 3+1 0..n arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.at n=15A250420
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 598", based on the 5-celled von Neumann neighborhood.at n=32A273151
- a(n) = a(n-1) + a(n-2) + a([(n+1)/2]), where a(0) = 1, a(1) = 1, a(2) = 1.at n=18A298348
- Matula-Goebel numbers of rooted trees in which all positive outdegrees are the same.at n=38A298424
- Partial sums of A301697.at n=60A301698
- G.f. A(x) satisfies: A(x) = 1 + x + x^2 + x^3 + x^4 * A(x/(1 - x)) / (1 - x)^2.at n=14A351707