5779
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 5780
- 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
- 5778
- Möbius Function
- -1
- Radical
- 5779
- 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
- 142
- 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
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 758
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = a(n-1) + a(n-2) - 1 for n > 1, a(0)=3, a(1)=2.at n=18A001612
- a(0) = 4; for n > 0, a(n) = a(n-1)^3 - 3*a(n-1)^2 + 3.at n=2A002813
- Pierce expansion of (3 - sqrt(5))/2.at n=5A006276
- Odd primes such that (3p+1)/2 and 3p+4 are also prime.at n=37A014223
- Convolution of Catalan numbers and squares.at n=9A014316
- 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 75.at n=15A031573
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 72 ones.at n=2A031840
- Multiplicity of highest weight (or singular) vectors associated with character chi_37 of Monster module.at n=35A034425
- a(n) is square mod a(i), i < n; a(n) prime; a(1) = 2.at n=10A034900
- Number of partitions of n with equal number of parts congruent to each of 0 and 1 (mod 3).at n=44A035534
- Numerators of continued fraction convergents to sqrt(118).at n=5A041214
- Numerators of continued fraction convergents to sqrt(472).at n=7A041900
- Discriminants of imaginary quadratic fields with class number 13 (negated).at n=22A046010
- Primes whose sum of digits is the perfect number 28.at n=6A048517
- Primes for which only three iterations of 'Prime plus its digit sum equals a prime' are possible.at n=2A048525
- Primes of the form k^2 + 3.at n=15A049423
- Primes of the form k(k+1)/2+1 (i.e., central polygonal numbers, or one more than triangular numbers).at n=32A055469
- Construct difference array so that (1) first row begins with 1, (2) every row is monotonic increasing, (3) no number appears more than once, (4) smallest number not yet used begins a new row. Sequence gives array read by antidiagonals.at n=54A056230
- Construct difference array so that (1) first row begins with 1, (2) every row is monotonic increasing, (3) no number appears more than once, (4) smallest number not yet used begins a new row. Sequence gives first row of array.at n=9A057153
- Smallest primitive prime factor of the n-th Lucas number (A000032); i.e., L(n), L(0) = 2, L(1) = 1 and L(n) = L(n-1) + L(n-2).at n=27A058036