5752
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
- 8
- Divisor Sum
- 10800
- Proper Divisor Sum (Aliquot Sum)
- 5048
- 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
- 2872
- Möbius Function
- 0
- Radical
- 1438
- Omega Function (Ω)
- 4
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 54
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence T3 for Zeolite Code MTN.at n=45A008188
- Composite n such that phi(n+4) = phi(n)+4.at n=38A056773
- Exponential generating function is exp(2*x/(1-x))/(1-x).at n=5A087912
- Numbers n such that for some k there exist k numbers a1,a2, ...,ak that concatenations of them is equal to n and sum of them is equal to Pi(n).at n=12A097222
- Indices of primes in sequence defined by A(0) = 43, A(n) = 10*A(n-1) + 33 for n > 0.at n=23A101730
- Numbers of isomers of unbranched a-4-catapolypentagons - see Brunvoll reference for precise definition.at n=10A121134
- Number of distinct resistances possible with at most n arbitrary resistors connected in series or in parallel.at n=5A123750
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k returns to the x-axis (1 <= k <= n).at n=38A128741
- Number of binary strings of length n with no substrings equal to 0001 0100 or 1010.at n=12A164465
- Irregular triangle E(n,g) counting not necessarily connected 3-regular simple graphs on 2n vertices with girth exactly g.at n=25A185130
- Number of not necessarily connected 3-regular simple graphs on 2n vertices with girth exactly 5.at n=10A185135
- Number of permutations p of 1,2,...,n satisfying |p(i+1)-p(i)|<>4 and |p(j+4)-p(j)|<>1 for all i=1..n-1, j=1..n-4.at n=8A189563
- Number of ways to place n nonattacking composite pieces rook + rider[1,4] on an n X n chessboard.at n=7A189851
- Triangle read by rows: T(n,k) is the number of peakless Motzkin paths of length n having k UHD's; here U=(1,1), H=(1,0), and D=(1,-1).at n=41A190172
- a(n) = A000129(n) + n.at n=11A209971
- Numbers n such that gcd(n, phi(n)) = gcd(phi(n), sigma(n)) = gcd(sigma(n), n) = tau(n).at n=12A217301
- Least even k such that sfdf(k-3) > sfdf(k-1) >= A050376(n), where sfdf(n) is the smallest Fermi-Dirac factor of n (A223490).at n=23A244343
- The Hwang-Deutsch function f_3(n).at n=31A260996
- Partial sums of A267326.at n=12A264390
- Number of nX4 binary arrays with rows and columns lexicographically nondecreasing and row and column sums nondecreasing.at n=6A266358