5757
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8160
- Proper Divisor Sum (Aliquot Sum)
- 2403
- 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
- 3600
- Möbius Function
- -1
- Radical
- 5757
- 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
- 129
- 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
- a(n) = (1/4 + 1/6 + ... + 1/c(n))*LCM{4, 6, ..., c(n)}, where c(n) = n-th composite number.at n=10A025545
- Molien series for complete weight enumerator of self-dual code over GF(5) containing all-1's vector.at n=14A028345
- a(n) = a(n-1) + a(floor(n/2)), a(1) = 1.at n=51A033485
- Decimal part of n-th root of a(n) starts with digit 3.at n=31A034080
- a(n) = T(2n-1,n), array T given by A048225.at n=40A048234
- a(n) = (Sum{k=0..n-1} a(k)) - a(n-3), with a(0)=0, a(1)=0, a(2)=1.at n=17A049856
- (n+1)!*(n+3)-3.at n=4A052225
- Shifts left under transform in formula line.at n=45A052336
- Least k such that k*10^n +/- 1 are twin primes.at n=40A064218
- Numbers k such that sigma(sigma(k)-k) = phi(k).at n=6A074875
- a(n) = floor(e^(n*g)), where g = Euler's Gamma constant, 0.57721566490153...at n=15A090170
- Difference between n-th prime squared and n-th perfect square.at n=21A106588
- Number triangle T(n,k) = Sum_{j=0..n} C(n-k,j-k)*C(j,n-j)*2^(n-j).at n=48A115991
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (-1, 1, 1), (0, 0, 1), (1, -1, 0), (1, 1, -1)}.at n=8A148492
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (0, 1, 1), (1, 0, 0), (1, 1, -1)}.at n=7A150235
- a(n) = 16*n^2 - n.at n=18A157446
- One-eighth of triangular numbers (integers only).at n=37A157716
- a(n) = 361*n^2 - 19.at n=3A158595
- Partial sums of A000141.at n=10A175361
- a(n) = Sum_{i+j=n, i,j >= 1} tau(i)*sigma(j), where tau() = A000005(), sigma() = A000203().at n=43A191831