5777
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5940
- Proper Divisor Sum (Aliquot Sum)
- 163
- 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
- 5616
- Möbius Function
- 1
- Radical
- 5777
- 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
- 142
- 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
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 2.at n=17A001610
- For n > 1: a(n) = a(n-1)^3 + 3a(n-1)^2 - 3; a(0) = 1, a(1) = 2.at n=3A002814
- a(n) = floor(n*phi^18), where phi is the golden ratio, A001622.at n=1A004933
- a(n) = F(2n+1) + F(2n-1) - 1.at n=9A005592
- Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032.at n=5A005845
- Pierce expansion of (3 - sqrt(5))/2.at n=4A006276
- Number of unordered sets of pairs (in-degree, out-degree) for nodes of directed trees on n unlabeled nodes (the edges are directed in arbitrary directions, the tree is unrooted).at n=11A007835
- a(n) = floor(phi^n), where phi = (1+sqrt(5))/2 is the golden ratio.at n=18A014217
- a(n) = prime(n)*(prime(n-1)-1)/2.at n=26A014302
- Strong pseudoprimes to base 76.at n=11A020302
- Rectangular array of numbers Fibonacci(m(n+1))/Fibonacci(m), m >= 1, n >= 0, read by downward antidiagonals.at n=57A028412
- Integer ratios of Fibonacci numbers F(m)/F(n).at n=46A031121
- Integers that appear as ratios of Fibonacci numbers F(kn)/F(k), but omitting Fibonacci numbers F(n)/F(1) and Lucas numbers F(2n)/F(n).at n=13A031122
- Number of partitions satisfying (cn(0,5) = 0 and cn(2,5) = cn(3,5)).at n=46A036815
- Numerators of continued fraction convergents to sqrt(642).at n=5A042232
- Numbers having three 7's in base 10.at n=5A043519
- a(n) = 5*F(n)^2 + 3*(-1)^n where F(n) are the Fibonacci numbers A000045.at n=9A047946
- Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n).at n=2A049062
- a(n) = Fibonacci(9*n)/34.at n=3A049669
- Values of n^2 + 1 resulting from A050796.at n=42A050800