9734
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15168
- Proper Divisor Sum (Aliquot Sum)
- 5434
- 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
- 9734
- 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
- 47
- 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
- McKay-Thompson series of class 33B for Monster.at n=37A058637
- Numbers k such that L(2*k + 1) is prime, where L(m) is a Lucas number.at n=32A117522
- a(n) is the number of free n-celled tree-shaped polyominoes.at n=10A131482
- 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, 1, 0), (0, 0, 1), (0, 1, -1), (1, -1, 0)}.at n=10A148104
- Triangle T(n,k) read by rows: Sum_{k=0..binomial(n,2)} T(n,k)*q^k = n!*Sum_{pi} faq(n,q)/Product_{i=1..n} e(i)!*faq(i,q)^e(i), where pi runs over all nonnegative integer solutions to e(1) + 2*e(2) + ... + n*e(n) = n and faq(i,q) = Product_{j=1..i} (q^j-1)/(q-1), i = 1..n.at n=28A152474
- Number of 3-step S, E, and NW-moving king's tours on an n X n board summed over all starting positions.at n=33A187508
- Number of 0..n arrays x(0..3) of 4 elements with zero 3rd differences.at n=30A200155
- Number of (w,x,y) with all terms in {0,...,n} and x != max(|w-x|,|x-y|).at n=21A213496
- Number of n element 0..3 arrays with each element the minimum of 7 adjacent elements of a random 0..3 array of n+6 elements.at n=10A217953
- Numbers k such that Sum_{j=1..k} tau(j)^j == 0 (mod k), where tau(j) = A000005(j), the number of divisors of j.at n=9A229207
- Numbers k such that 1 + k + k^3 + k^5 + k^7 + k^9 + ... + k^57 is prime.at n=25A244390
- Numbers that are representable in at least two ways as sums of four distinct nonvanishing squares.at n=40A259058
- Expansion of Product_{k>=1} ((1 + k*x^k) / (1 - k*x^k))^k.at n=8A266942
- Values of k such that L(k)*L(k+1)-1 is a prime, where L(k) is the k-th Lucas number (A000032).at n=24A271430
- Number of 2 X n 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=15A279742
- Expansion of Product_{k>=1} 1/(1 - x^k * (1 - x)).at n=38A306749
- k such that L(H(k,2)) = 2*L(H(k,1)) where L(x) is the number of terms in the continued fraction of x and H(k,r) = Sum_{u=1..k} 1/u^r.at n=40A336088
- a(n) = one-half of the number of cells in the central rectangle of the graph described in row 2n+1 of A333288.at n=19A337640
- Triangle T(n,p) read by rows: the number of n-celled polyominoes with perimeter 2p, 2 <= p <= 1+n.at n=65A342243
- Numbers that are the sum of nine fourth powers in exactly seven ways.at n=31A345849