5761
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6592
- Proper Divisor Sum (Aliquot Sum)
- 831
- 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
- 4932
- Möbius Function
- 1
- Radical
- 5761
- 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
- 173
- 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
- Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, P(n) = A(n) - V(n); A000099 gives values of n where |P(n)| sets a new record; sequence gives A(A000099(n)).at n=23A000323
- Number of tournaments on n nodes determined by their score vectors.at n=17A000570
- Numbers k such that Fib(k) == -13 (mod k).at n=21A023167
- n written in fractional base 8/5.at n=49A024647
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 52 ones.at n=8A031820
- a(n) = n*(2*n^2 - 3*n + 4)/3.at n=21A037235
- Base 8 digits are, in order, the first n terms of the periodic sequence with initial period 1,3,2,0.at n=4A037713
- Number of degree-n permutations of order dividing 7.at n=8A053497
- Number of n X n binary matrices of order dividing 7 (i.e., number of solutions of X^7=I in GL(n,2)).at n=3A053772
- Number of n X n matrices over GF(4) of order dividing 7 (i.e., number of solutions of X^7=I in GL(n,4)).at n=2A053862
- Number of step shifted (decimated) sequence structures using exactly six different symbols.at n=9A056400
- Number of primitive (aperiodic) step shifted (decimated) sequence structures using exactly six different symbols.at n=9A056410
- Generalized Markoff numbers: union of numbers a, b, c, d satisfying the Markoff(4) equation a^2 + b^2 + c^2 + d^2 = 4*a*b*c*d.at n=10A075276
- a(n) = floor(T(n+1)!*T(n-1)!/(T(n)!)^2), where T(n) = n(n+1)/2 = the n-th triangular number.at n=38A077539
- Triangle, read by rows, where the g.f. of row n, R_n(x), is a polynomial of degree n that satisfies: [x^k] R_{n+1}(x) = [x^k] (1 + x*R_n(x))^(n+1) for k=0..n+1, with R_0(x) = 1.at n=32A108990
- Numbers k such that k^6+6 is prime.at n=28A109836
- One third of the sum of the first n primes, when an integer.at n=26A112270
- Semiprimes (A001358) that are sums of distinct factorials.at n=32A115646
- Numbers k such that 16*k+1, 16*k+3 and 16*k+13 are primes.at n=43A123992
- Numbers n whose reverse binary representation has the following property: let a 0 mean "halving" and a 1 mean "k -> 3k+1". The number describes an operation k -> f_n(k). If the equation f_n(k) = k has a positive integer solution, n is a term in the sequence.at n=32A125756