4138
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6210
- Proper Divisor Sum (Aliquot Sum)
- 2072
- 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
- 2068
- Möbius Function
- 1
- Radical
- 4138
- 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
- 126
- 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
- yes
- Odd
- no
Appears in sequences
- Number of n-step anisotropic spirals on cubic lattice.at n=6A006780
- Coordination sequence T3 for Zeolite Code EPI.at n=40A008092
- Coordination sequence T2 for Zeolite Code NES.at n=41A008206
- Triangle of coefficients from fractional iteration of e^x - 1.at n=22A008826
- Number of proper partitions of a set of n labeled elements.at n=6A008827
- Coordination sequence T3 for Zeolite Code VET.at n=39A009904
- Numbers k such that the continued fraction for sqrt(k) has period 35.at n=10A020374
- a(n) = Sum_{d | n} mu(n/d) * Bell(d-1).at n=8A034743
- Number of rooted trees where each node has at most 4 children.at n=12A036718
- Numbers whose base-16 representation has exactly 4 runs.at n=24A043677
- Numbers whose base-4 representation contains exactly three 0's and three 2's.at n=10A045055
- a(n) = Sum_{ d divides n } q(d), where q(d) = A000009 = number of partitions of d into distinct parts.at n=50A047966
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=44A050041
- Coefficients of the '3rd-order' mock theta function omega(q).at n=40A053253
- a(n) = 2*n^2 + 6*n + 2.at n=44A090288
- Numbers k such that the numerator of Bernoulli(2k) is divisible by the square of 37, the first irregular prime.at n=15A092230
- Number of plasma partitions of 2n-1.at n=42A095913
- a(n) = Sum_{i=2..n} A055211(i).at n=35A097590
- Values of k for which 7m+1, 8m+1 and 11m+1 are prime, with m = 1848k + 942.at n=35A101186
- Positive integers n such that n^17 + 1 is semiprime (A001358).at n=37A104494