9329
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
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9840
- Proper Divisor Sum (Aliquot Sum)
- 511
- 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
- 8820
- Möbius Function
- 1
- Radical
- 9329
- 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
- Number of strict (-1)st-order maximal independent sets in cycle graph.at n=18A007390
- Numbers such that ten iterations of Reverse and Add are needed to reach a palindrome.at n=5A015991
- Numbers k such that the continued fraction for sqrt(k) has period 78.at n=25A020417
- Convolution of natural numbers >= 2 and Fibonacci numbers.at n=15A023548
- Diagonal sum of left-justified array T given by A027023.at n=25A027037
- Number of partitions satisfying cn(2,5) <= cn(0,5) and cn(3,5) <= cn(0,5).at n=40A039863
- a(n)=T(n,n+1), array T as in A049735.at n=38A049741
- a(n) = Sum_{k=1..floor(n/2)} T(n, 2k), array T as in A049777.at n=36A049779
- Number of partitions of n in SPM(n): these are the partitions obtained from (n) by iteration of the following transformation: p -> p' if p' is a partition (i.e., decreasing) and p' is obtained from p by removing a unit from the i-th component of p and adding one to the (i+1)-th component, for any i.at n=44A056219
- Composite numbers whose divisors (except 1) all contain the digit 9.at n=13A062680
- Numbers which need ten 'Reverse and Add' steps to reach a palindrome.at n=5A065215
- Start with 1015 and repeatedly reverse the digits and add 4 to get the next term.at n=13A117807
- a(n) = Sum_{k=1..n} floor(n^2/k).at n=46A118014
- Start with 1027 and repeatedly reverse the digits and add 16 to get the next term.at n=25A119455
- Start with 1013 and repeatedly reverse the digits and add 2 to get the next term.at n=27A120214
- G.f. A(x) satisfies A(x/A(x)^4) = 1 + x; thus A(x) = 1 + series_reversion(x/A(x)^4).at n=5A120974
- Semiprimes whose factors are decimal palindromes when concatenated, omitting multiples of primes less than 11.at n=24A144719
- 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, 0), (-1, 0, 1), (0, 0, -1), (0, 1, 0), (1, -1, 0)}.at n=10A148186
- Number of n X 2 binary arrays with all 1s connected, a path of 1s from left column to lower right corner, and no 1 having more than two 1s adjacent.at n=15A163704
- a(n) = n*(13*n-3)/2.at n=38A186030