6715
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8640
- Proper Divisor Sum (Aliquot Sum)
- 1925
- 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
- 4992
- Möbius Function
- -1
- Radical
- 6715
- 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
- 137
- 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
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite ATS = MAPO-36 H[MgAl11P12O48] starting with a T3 atom.at n=5A018987
- Numbers k such that k + sum of its prime factors = (k+1) + sum of its prime factors.at n=19A020700
- Convolution of natural numbers n >= 1 with Fibonacci numbers F(k), k >= 3.at n=13A033937
- Numbers whose base-5 representation contains exactly two 0's and three 3's.at n=19A045198
- a(n) = A047881(n) / 2.at n=32A047882
- a(n) = (6*n+1)*(6*n+7).at n=13A085026
- Bisection of A088567.at n=50A088585
- Consider the family of ordinary multigraphs. Sequence gives the triangle read by rows giving coefficients of polynomials arising from enumeration of those multigraphs on n edges.at n=29A098233
- Second bisection of A061039.at n=39A144450
- Partial sums of A050705.at n=41A177791
- Number of nondecreasing arrangements of n+2 numbers in 0..4 with each number being the sum mod 5 of two others.at n=15A183907
- a(n) = Sum_{y=1..n} Sum_{x=1..n} floor((x^k + y^k)^(1/k)) with k = 3.at n=20A211792
- Coefficients of the generalized continued fraction expansion sqrt(e) = a(1) +a(1)/(a(2) +a(2)/(a(3) +a(3)/(a(4) +a(4)/....))).at n=13A233584
- Triangle T(n, k) = Numbers of ways to place k points on a triangular grid of side n so that no two of them are adjacent. Triangle read by rows.at n=28A239567
- Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that min(x(i) - x(i-1)) is not a part of p.at n=31A241761
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 507", based on the 5-celled von Neumann neighborhood.at n=19A272587
- Records in A249860.at n=31A276705
- p-INVERT of (1,1,0,0,0,0,...), where p(S) = (1 - 2 S)(1 - 3 S).at n=5A291395
- The number of triangular lattice points whose Euclidean distance from the origin is less than or equal to n.at n=43A308685
- Expansion of Product_{k=1..8} (1+x^(2*k-1))/(1-x^(2*k)).at n=45A316720