3325
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 4960
- Proper Divisor Sum (Aliquot Sum)
- 1635
- 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
- 2160
- Möbius Function
- 0
- Radical
- 665
- 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
- 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
- 136
- 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
- Generalized Stirling numbers, [n+7,7]_5.at n=3A001722
- a(n) = floor(3^n / 2^n).at n=20A002379
- Number of achiral trees with n nodes.at n=17A005629
- [ sqrt(3/2)^n ].at n=40A014215
- Define the generalized Pisot sequence T(a(0),a(1)) by: a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n). This is T(3,5).at n=22A018917
- Pseudoprimes to base 18.at n=26A020146
- Pseudoprimes to base 26.at n=26A020154
- Pseudoprimes to base 68.at n=44A020196
- a(n) = 2nd elementary symmetric function of the first n+1 positive integers congruent to 1 mod 4.at n=5A024378
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (composite numbers).at n=27A024860
- Lucky numbers with size of gaps equal to 12 (upper terms).at n=37A031895
- Lucky numbers with size of gaps equal to 14 (lower terms).at n=14A031896
- a(n) = (2*n+1)*(11*n+1).at n=12A033575
- Number of partitions of n into parts not of the form 13k, 13k+6 or 13k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 5 are greater than 1.at n=31A035954
- Matrix 4th power of partition triangle A008284.at n=56A039806
- Matrix 5th power of Stirling2 triangle A008277.at n=11A039813
- Numerators of continued fraction convergents to sqrt(794).at n=8A042530
- Numbers n such that string 2,5 occurs in the base 10 representation of n but not of n-1.at n=37A044357
- Numbers n such that string 2,5 occurs in the base 10 representation of n but not of n+1.at n=37A044738
- Numbers whose base-4 representation contains exactly one 0 and four 3's.at n=20A045070