3015
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 5304
- Proper Divisor Sum (Aliquot Sum)
- 2289
- 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
- 1584
- Möbius Function
- 0
- Radical
- 1005
- Omega Function (Ω)
- 4
- 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
- yes
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 92
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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) = 2*a(n-1) - a(n-2) + a(n-3) + 2^(n-1).at n=10A000253
- Pentagonal numbers: a(n) = n*(3*n-1)/2.at n=45A000326
- Alkane (or paraffin) numbers l(7,n).at n=17A005994
- Coordination sequence T2 for Zeolite Code MFI.at n=35A008165
- Coordination sequence T5 for Zeolite Code MFI.at n=35A008168
- Molien series for A_10.at n=29A008633
- Number of partitions of n into at most 10 parts.at n=29A008639
- Expansion of Product_{k>=1} (1 - x^k)^9.at n=34A010817
- Expansion of 1/((1-x)^3*(1-x^3)^2).at n=24A011779
- Odd pentagonal numbers.at n=22A014632
- Coordination sequence T3 for Zeolite Code CGF.at n=38A019453
- Pseudoprimes to base 89.at n=39A020217
- Pseudoprimes to base 91.at n=33A020219
- Strong pseudoprimes to base 91.at n=6A020317
- Place where n-th 1 occurs in A023125.at n=28A022787
- Base 6 expansion uses each positive digit just once.at n=29A023744
- a(n) = (prime(n)^2 - 1)/24.at n=54A024702
- Number of partitions of n in which the greatest part is 10.at n=39A026816
- For n odd, >1, not divisible by 3, we can write 3/n = 1/a + 1/b + 1/c with a>b>c>0, a,b,c distinct and odd; sequence gives smallest a.at n=21A027442
- For n != 1 mod 3, we can write 3/(2n+1) = 1/a + 1/b + 1/c with a>b>c>0, a,b,c distinct and odd; sequence gives smallest such a, or 1 if n = 1 mod 3.at n=32A027443