3009
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 4320
- Proper Divisor Sum (Aliquot Sum)
- 1311
- 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
- 1856
- Möbius Function
- -1
- Radical
- 3009
- 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
- 40
- 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
- -1 + number of partitions of n.at n=27A000065
- Number of partitions of n into at most 6 parts.at n=38A001402
- a(n) = (10n+1)*(10n+9).at n=5A001535
- Crystal ball sequence for hexagonal close-packing.at n=9A007202
- Coordination sequence T1 for Zeolite Code BRE.at n=36A008058
- Coordination sequence T3 for Zeolite Code DOH.at n=34A008080
- Crystal ball sequence for planar net 4.8.8.at n=47A008577
- Numbers k such that sigma(k) = sigma(k+12).at n=27A015882
- Pseudoprimes to base 58.at n=18A020186
- a(n) = least m such that if r and s in {1/1, 1/4, 1/7,..., 1/(3n-2)} satisfy r < s, then r < k/m < s for some integer k.at n=36A024822
- a(n) = least m such that if r and s in {1/1, 1/2, 1/3, ..., 1/n} satisfy r < s, then r < k/m < (k+2)/m < s for some integer k.at n=33A024840
- Number of partitions of n in which the greatest part is 6.at n=44A026812
- Maximal value of Q(n,m) (number of partitions of n into m distinct summands) for given n.at n=58A030699
- Positions of record values in A030737.at n=48A030742
- a(n) = n*(2*n^2 - 3*n + 4)/3.at n=17A037235
- Sums of 5 distinct powers of 3.at n=42A038467
- Number of partitions satisfying cn(0,5) + cn(1,5) <= 1 and cn(0,5) + cn(4,5) <= 1.at n=43A039850
- Numbers k such that the string 0,9 occurs in the base 10 representation of k but not of k-1.at n=31A044341
- Numbers n such that string 0,0 occurs in the base 10 representation of n but not of n+1.at n=29A044713
- Numbers n such that string 0,9 occurs in the base 10 representation of n but not of n+1.at n=31A044722