9489
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12656
- Proper Divisor Sum (Aliquot Sum)
- 3167
- 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
- 6324
- Möbius Function
- 1
- Radical
- 9489
- 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
- 153
- 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) = ceiling(Pi^n).at n=8A001673
- Nearest integer to Pi^n.at n=8A002160
- Molien series for A_6.at n=48A008629
- Eleven iterations of Reverse and Add are needed to reach a palindrome.at n=40A015992
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 64.at n=29A031562
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 48 ones.at n=34A031816
- Shifts left 3 places under "CIJ" (necklace, indistinct, labeled) transform.at n=9A032187
- Revert transform of 2*x*(1 - x - x^5)-x/(1+x).at n=8A049176
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 99 ).at n=34A063372
- Numbers which need eleven 'Reverse and Add' steps to reach a palindrome.at n=38A065216
- Numbers n such that log_pi(n) is closer to an integer than is log_pi(m) for any m with 2<=m<n.at n=6A080022
- This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of tetrahedral numbers. The p-th row (p>=1) contains a(i,p) for i=1 to 3*p-2, where a(i,p) satisfies Sum_{i=1..n} C(i+2,3)^p = 4 * C(n+3,4) * Sum_{i=1..3*p-2} a(i,p) * C(n-1,i-1)/(i+3).at n=24A087107
- a(n) = ceiling(Pi^(n/2)).at n=16A102477
- Numbers n such that every digit of n and n-th prime contains a loop (only digits 0,4,6,8,9 in n and n-th prime).at n=14A107624
- Low point in segment n of A079051.at n=38A117518
- First semiprime after Pi^n.at n=8A117881
- Consider the smallest k such that prime(k) > n*composite(k). Sequence gives composite(k).at n=8A125075
- Numbers k with property that sum of divisors of k-th triangular number is some m-th triangular number.at n=10A175849
- a(n) = ceiling( Pi^(n/3) ).at n=23A212463
- Number of n X 2 binary arrays indicating whether each 2 X 2 subblock of a larger binary array has lexicographically increasing rows and columns, for some larger (n+1) X 3 binary array with rows and columns of the latter in lexicographically nondecreasing order.at n=14A227085