2659
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 2660
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 2658
- Möbius Function
- -1
- Radical
- 2659
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 53
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 385
- 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 5 denominations and n stamps.at n=12A001210
- Primes of the form m^2 + 3m + 9, where m can be positive or negative.at n=20A005471
- Coordination sequence T1 for Zeolite Code AEL.at n=34A008004
- Coordination sequence T3 for Zeolite Code AFO.at n=34A008017
- Coordination sequence T2 for Zeolite Code EUO.at n=32A008097
- Coordination sequence T5 for Zeolite Code TER.at n=35A016437
- Let q_k = p*(p+2) be product of k-th pair of twin primes; sequence gives values of p+2 such that (q_k)^2 > q_{k-i}*q_{k+i} for all 1 <= i <= k-1.at n=24A021007
- n-th prime p(k) such that p(k) + p(k+9) = p(k+3) + p(k+6).at n=31A022893
- Primes that remain prime through 2 iterations of the function f(x) = 2x + 5.at n=37A023243
- Primes that are palindromic in base 5.at n=21A029973
- Primes that are palindromic in base 14.at n=28A029981
- a(n) = prime(9*n - 2).at n=42A031383
- 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 51.at n=5A031549
- a(n) = prime(10*n - 5).at n=38A031910
- Primes of form x^2+87*y^2.at n=26A033256
- Multiplicity of highest weight (or singular) vectors associated with character chi_22 of Monster module.at n=33A034410
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 3 (mod 5).at n=37A035564
- Number of partitions of n into parts not of the form 21k, 21k+2 or 21k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 9 are greater than 1.at n=31A035980
- Numerators of continued fraction convergents to sqrt(913).at n=7A042764
- Base-5 palindromes that start with 4.at n=18A043009