2613
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 3808
- Proper Divisor Sum (Aliquot Sum)
- 1195
- 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
- 1584
- Möbius Function
- -1
- Radical
- 2613
- 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
- 27
- 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
- Number of strict 7th-order maximal independent sets in cycle graph.at n=51A007394
- Coordination sequence T1 for Zeolite Code GOO.at n=35A008111
- Number of partitions of n into distinct parts, none being 5.at n=51A015750
- a(n) = n*(31*n-1)/2.at n=13A022288
- a(n) = T(2n+1,n+2), T given by A026747.at n=5A026866
- Number of partitions of n into an odd number of parts, the least being 3; also, a(n+3) = number of partitions of n into an even number of parts, each >=3.at n=49A027189
- Numbers k such that k^2 + k + 4 is a palindrome.at n=9A027716
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 34.at n=17A031532
- Numbers for which the sum of reciprocals of digits is an integer.at n=43A034708
- Concatenations C1 and C2 are both prime (see the comment lines).at n=38A034815
- Decimal part of a(n)^(1/n) starts with a 'nine digits' anagram.at n=35A035136
- Number of partitions of n with equal number of parts congruent to each of 2 and 3 (mod 5).at n=35A035559
- Numbers k such that d(i) is a power of 2 for all k <= i <= k+6, where d(i) = number of divisors of i.at n=42A036540
- Number of partitions satisfying (cn(2,5) = cn(3,5) = 0 and cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5)).at n=49A036823
- Numerators of continued fraction convergents to sqrt(277).at n=6A041520
- Numbers whose base-3 representation has exactly 8 runs.at n=22A043588
- Numbers whose number of runs in base 3 is congruent to 1 (mod 7).at n=36A043792
- Numbers n such that number of runs in the base 3 representation of n is congruent to 0 mod 8.at n=22A043798
- Numbers n such that number of runs in the base 3 representation of n is congruent to 8 mod 9.at n=22A043814
- Numbers k such that number of runs in the base 3 representation of k is congruent to 8 mod 10.at n=22A043823