4135
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4968
- Proper Divisor Sum (Aliquot Sum)
- 833
- 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
- 3304
- Möbius Function
- 1
- Radical
- 4135
- 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
- 95
- 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
- Number of partitions into non-integral powers.at n=15A000135
- Coordination sequence T3 for Zeolite Code MTT.at n=40A008191
- Coordination sequence T2 for Zeolite Code ZON.at n=45A009920
- Numbers k such that the continued fraction for sqrt(k) has period 40.at n=32A020379
- Least m such that if r and s in {1/3, 1/6, 1/9, ..., 1/3n} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=28A024838
- T(2n,n), where T is the array defined in A024996.at n=6A026073
- a(n) = T(n,[ n/2 ]), where T is the array defined in A024996.at n=12A026078
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 11.at n=38A031509
- Path-counting triangular array T(i,j), read by rows, obtained from array t in A038792 by T(i,j) = t(2*i-j, j) (for i >= 1 and 1 <= j <= i).at n=52A038730
- T(n,n-2), array T as in A038792.at n=7A038737
- T(n+4,n), array T as in A038792.at n=7A038797
- Numbers whose base-16 representation has exactly 4 runs.at n=21A043677
- Irregular triangle read by rows giving T(n,k) = number of rooted graphs on n + 1 nodes with k edges (n >= 0, 0 <= k <= n(n-1)/2).at n=73A070166
- Positions of check bits in code in A075931.at n=41A075933
- Expansion of 1/(x + sqrt(1-4x)).at n=8A081696
- a(n) = 6*n^2 + 3*n + 1.at n=26A085473
- Sum of first n 3-almost primes.at n=42A086062
- Triangle read by rows in which each row is the inverse binomial transform of a diagonal of A089246.at n=52A089302
- a(1) = 3, a(n) = a(n-1) + 4*(a(n-1)-floor(a(n-1)^(1/3))^3).at n=13A096297
- a(n) = Sum_{k=0..floor(n/2)} binomial(n-k+3, k).at n=15A099571