9039
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12672
- Proper Divisor Sum (Aliquot Sum)
- 3633
- 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
- 5720
- Möbius Function
- -1
- Radical
- 9039
- 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
- 91
- 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
- Eleven iterations of Reverse and Add are needed to reach a palindrome.at n=30A015992
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite DDR = Deca-dodecasil 3R[Si120O240]qR starting with a T1 atom.at n=12A019110
- Number of distinct 'failure tables' for a string of length n.at n=11A022543
- Numbers which need eleven 'Reverse and Add' steps to reach a palindrome.at n=28A065216
- Engel expansion of log(1+e).at n=7A068376
- Expansion of (1-x)^(-1)/(1-2*x+2*x^2+x^3).at n=19A077861
- Numbers k such that T(k) = T(A072522(k)) + T(A072522(k+1)), T(i) being the triangular numbers.at n=21A080824
- Minimal k > n such that (4k+3n)(4n+3k) is a square.at n=22A083752
- a(n) = (10^k - n)(10^k + n), where k is the number of digits in n.at n=30A110397
- Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 10 multiples of n-1, n-2, ..., 1, for n>=1.at n=43A113747
- Expansion of g.f. -x*(10*x^4+12*x^3-x^2-3*x-3)/((x^2+x-1)*(4*x^3+x^2-x-1)).at n=19A134704
- G.f. satisfies: A(x) = Sum_{n>=0} x^(n^2) * A(x)^n.at n=18A157134
- Number of lines through at least 2 points of a 6 X n grid of points.at n=33A160846
- Ascending sequence of numbers such that the sum of any two distinct elements (even + odd) is a prime number.at n=28A180743
- Position of 2^n in A051037 (5-smooth numbers).at n=56A188425
- Number of nX6 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=3A208162
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=39A208164
- Number of 4Xn 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=5A208165
- Odd indices n for which A046825(n) is not larger than A046825(n-1).at n=30A214453
- a(n) = (2*n-1)^2 + 14.at n=47A242412