3095
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3720
- Proper Divisor Sum (Aliquot Sum)
- 625
- 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
- 2472
- Möbius Function
- 1
- Radical
- 3095
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 35
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Number of non-Abelian metacyclic groups of order 2^n.at n=48A007982
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k=[ (n+1)/2 ], s = (natural numbers >= 2), t = (natural numbers >= 3).at n=29A024306
- a(n) = 2*(n+1) + 3*n + ... + (k+1)*(n+2-k), where k = floor(n/2).at n=29A024868
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = floor( n/2 ), s = natural numbers >= 2, t = natural numbers >= 3.at n=28A024869
- "CGJ" (necklace, element, labeled) transform of 2,1,1,1...at n=7A032148
- Coordination sequence T2 for Zeolite Code SBS.at n=44A033609
- Multiplicity of highest weight (or singular) vectors associated with character chi_21 of Monster module.at n=36A034409
- Number of partitions in parts not of the form 25k, 25k+3 or 25k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=30A036002
- Number of bicentered 5-valent trees with n nodes.at n=15A036649
- Numbers n such that string 9,5 occurs in the base 10 representation of n but not of n-1.at n=33A044427
- Numbers k such that string 9,5 occurs in the base 10 representation of k but not of k+1.at n=33A044808
- Floor( Pi * (3/2)^n ).at n=17A047625
- a(n) = Sum_{ d divides n } q(d), where q(d) = A000009 = number of partitions of d into distinct parts.at n=47A047966
- Numbers n such that n = pi(n)*k + 1 for some k.at n=21A065136
- Number of subsets S of the power set P{1,2,...,n} such that: {1}, {2},..., {n} are all elements of S; if X and Y are elements of S and X and Y have a nonempty intersection, then the union of X and Y is an element of S. The sets S are counted modulo permutations on the elements 1,2,...,n.at n=5A072444
- Numbers k such that (4*10^(k-1) - 7)/3 is a plateau prime.at n=8A082697
- Numbers n such that n, n+2, n+4, n+6 are semiprimes.at n=29A092126
- Numbers k such that k, k+2, k+4, k+6, k+8 are semiprimes.at n=11A092127
- a(n) = Sum_{2*i+3*j=n, 0<=i<=n, 0<=j<=n} n!/( (2*i)!*(3*j)! ).at n=14A094715
- Index k in A095773 where a string of n identical values occurs.at n=16A096183