9061
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10584
- Proper Divisor Sum (Aliquot Sum)
- 1523
- 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
- 7680
- Möbius Function
- -1
- Radical
- 9061
- 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
- 65
- 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
- Numerator of Sum_{i+j+k=n; i,j,k > 0} 1/(i*j*k).at n=11A002545
- Fermat pseudoprimes to base 4.at n=42A020136
- Pseudoprimes to base 18.at n=39A020146
- Pseudoprimes to base 21.at n=23A020149
- Pseudoprimes to base 33.at n=28A020161
- Pseudoprimes to base 50.at n=43A020178
- Pseudoprimes to base 72.at n=31A020200
- Pseudoprimes to base 84.at n=26A020212
- Pseudoprimes to base 86.at n=39A020214
- Strong pseudoprimes to base 21.at n=5A020247
- Numbers k such that the continued fraction for sqrt(k) has period 29.at n=23A020368
- Fibonacci sequence beginning 3, 13.at n=15A022124
- Numbers whose set of base-14 digits is {3,4}.at n=18A032838
- a(n) = (2*n+1)*(11*n+1).at n=20A033575
- Number of partitions satisfying cn(0,5) < cn(1,5) + cn(2,5) + cn(3,5) and cn(0,5) < cn(4,5) + cn(2,5) + cn(3,5).at n=32A039847
- Denominators of continued fraction convergents to sqrt(983).at n=7A042903
- (s(n)+1)/10, where s(n)=n-th base 10 palindrome that starts with 9.at n=28A043088
- Numbers n such that n through n+5 have the same number of distinct prime factors.at n=12A045934
- a(n)=T(n,n), array T as in A049735.at n=38A049740
- a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 1,1,4.at n=15A049867