3195
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 5616
- Proper Divisor Sum (Aliquot Sum)
- 2421
- 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
- 1680
- Möbius Function
- 0
- Radical
- 1065
- 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
- 74
- 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) is the solution to the postage stamp problem with n denominations and 4 stamps.at n=19A001214
- a(n) = a(n-1) + a(n-2) - 1.at n=17A001588
- Expansion of (1-x)/((1+x)*(1-2*x)*(1-3*x)).at n=7A004054
- Numbers k such that k | 14^k + 1.at n=41A015965
- Expansion of Product_{m>=1} (1+x^m)^3.at n=15A022568
- a(n) = s(n+3)/6, where s is A024743.at n=7A024744
- a(n) = s(n+3)/2, where s is A024963.at n=6A024964
- Congruence classes of triangles which can be drawn using lattice points in n X n grid as vertices.at n=11A028419
- Numbers k such that 261*2^k+1 is prime.at n=43A032507
- Multiplicity of highest weight (or singular) vectors associated with character chi_18 of Monster module.at n=34A034406
- Shifts left under transform T where Ta is phi DCONV a.at n=38A038045
- Denominators of continued fraction convergents to sqrt(761).at n=9A042467
- Numbers n such that string 9,5 occurs in the base 10 representation of n but not of n-1.at n=34A044427
- Numbers k such that string 9,5 occurs in the base 10 representation of k but not of k+1.at n=34A044808
- Numbers whose base-5 representation contains exactly three 0's and one 1.at n=39A045170
- Numbers whose base-5 representation contains exactly three 0's and one 4.at n=34A045215
- Convolution of A000108 (Catalan numbers) with A020922.at n=3A045530
- Triangle related to A001700 and A000302 (powers of 4).at n=41A046658
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives j values.at n=24A053720
- Numbers k such that k! is divisible by the square of (f+d)!^2 for d = 0, 1 and 2 (and possibly larger d), where f = floor(k/2).at n=11A056068