5727
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8064
- Proper Divisor Sum (Aliquot Sum)
- 2337
- 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
- 3608
- Möbius Function
- -1
- Radical
- 5727
- 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
- 80
- 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
- Number of bipartite partitions of n white objects and 5 black ones.at n=11A000491
- Number of 5-level rooted trees with n leaves.at n=8A007714
- Apply partial sum operator thrice to partition numbers.at n=14A014160
- Expansion of 1/(1-x^5-x^6-x^7-x^8-x^9-x^10-x^11-x^12).at n=40A017843
- Number of factorizations with 3 levels of parentheses indexed by prime signatures. A050340(A025487).at n=24A050341
- McKay-Thompson series of class 42a for Monster.at n=44A058675
- a(1)=1; a(n) is the smallest integer > a(n-1) such that the sum of elements of the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^2.at n=21A071183
- Numbers n such that p = n^2 + 2, p+2 and p+6 are consecutive primes.at n=15A086380
- Numbers k such that p=k^2+2 and p+2 are primes.at n=52A086381
- Recurrence sequence based on positions of digits in decimal places of 1/G, where G is Catalan's constant (also often called K).at n=12A098323
- Numbers k for which 8*k+1, 8*k+5 and 8*k+7 are primes.at n=37A123980
- Numbers k for which 8*k+1, 8*k+5, 8*k+7 and 8*k+11 are primes.at n=15A123983
- a(n) = (n^5 + 145*n^4 + 905*n^3 + 155*n^2 + 594*n + 120)/120.at n=7A143060
- Greatest number m such that the fractional part of (11/10)^A153687(m) >= 1-(1/m).at n=13A153691
- Greatest number m such that the fractional part of (11/10)^A153688(n) >= 1-(1/m).at n=5A153692
- G.f.: A(q) = exp( Sum_{n>=1} A002129(n) * 3*A038500(n) * q^n/n ).at n=16A161804
- A trisection of A161804: a(n) = A161804(3n+1) for n>=0.at n=5A161806
- a(n) = 3*n^2 - 2*n + 7.at n=44A191413
- Number of digits of A014980(n) in decimal representation.at n=16A194079
- a(n) = (prime(n) - 1)*(prime(n+1) - 1)/2 + 3.at n=27A201498