2615
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3144
- Proper Divisor Sum (Aliquot Sum)
- 529
- 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
- 2088
- Möbius Function
- 1
- Radical
- 2615
- 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
- 177
- 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 unlabeled mappings (or mapping patterns) from n points to themselves; number of unlabeled endofunctions.at n=9A001372
- 7th-order maximal independent sets in cycle graph.at n=51A007389
- Coordination sequence T3 for Zeolite Code NON.at n=31A008214
- Expansion of 1/(1-x^5-x^6-x^7-x^8-x^9-x^10).at n=39A017841
- Expansion of 1/((1-5*x)*(1-6*x)*(1-8*x)).at n=3A019783
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t = A002808 (composite numbers).at n=25A023863
- 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=24A024860
- Numbers k such that the continued fraction for sqrt(k) has even period 2*m and the m-th term of the periodic part is 9.at n=31A031412
- Number of partitions of n with equal number of parts congruent to each of 1, 2 and 3 (mod 5).at n=50A035578
- Number of partitions of n into parts not of the form 21k, 21k+6 or 21k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=27A035984
- Coordination sequence for Zeolite Code DFT.at n=35A038408
- Coordination sequence T8 for Zeolite Code STT.at n=34A038418
- Denominators of continued fraction convergents to sqrt(422).at n=7A041803
- Numbers whose base-3 representation has exactly 8 runs.at n=23A043588
- Numbers whose number of runs in base 3 is congruent to 1 (mod 7).at n=37A043792
- Numbers n such that number of runs in the base 3 representation of n is congruent to 0 mod 8.at n=23A043798
- Numbers n such that number of runs in the base 3 representation of n is congruent to 8 mod 9.at n=23A043814
- Numbers k such that number of runs in the base 3 representation of k is congruent to 8 mod 10.at n=23A043823
- Numbers k such that the string 2,5 occurs in the base 9 representation of k but not of k-1.at n=36A044274
- Numbers n such that string 1,5 occurs in the base 10 representation of n but not of n-1.at n=29A044347