4082
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6636
- Proper Divisor Sum (Aliquot Sum)
- 2554
- 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
- 1872
- Möbius Function
- -1
- Radical
- 4082
- 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
- 64
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = 2^n - n - 2.at n=10A000247
- Certain subgraphs of a directed graph (binomial transform of A005321).at n=5A005331
- 4-dimensional analog of centered polygonal numbers.at n=13A006325
- Coordination sequence T5 for Zeolite Code AET.at n=44A008011
- Coordination sequence T3 for Zeolite Code ATS.at n=46A008040
- Triangle T(n,k) of associated Stirling numbers of second kind, n >= 2, 1 <= k <= floor(n/2).at n=37A008299
- Numbers k such that the continued fraction for sqrt(k) has period 9.at n=25A010339
- Expansion of 1/(1-x^7-x^8-x^9-x^10-x^11-x^12-x^13).at n=52A017862
- a(n) = Sum_{k >= 1} floor(3*tau^(n-k)).at n=13A020958
- a(n) = least m such that if r and s in {1/2, 1/5, 1/8, ..., 1/(3n-1)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=28A024837
- "CFK" (necklace, size, unlabeled) transform of 2,2,2,2...at n=18A032139
- Numbers k such that 99*2^k+1 is prime.at n=34A032399
- a(n) = floor(10000/sqrt(n)).at n=5A033433
- a(n) = (10*n^3 - 9*n^2 + 2*n)/3 + 1.at n=11A034721
- Number of partitions of n into parts not of the form 13k, 13k+4 or 13k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 5 are greater than 1.at n=32A035952
- Path-counting array T(i,j) obtained from array t in A038792 by T(i,j)=t(2i+1,j).at n=50A038738
- T(n,n-4), array T as in A038738.at n=5A038741
- T(n,n-5), array T as in A038792.at n=14A038795
- Numbers having three 5's in base 9.at n=13A043475
- a(n) is the smallest value of m such that A002378(m), the m-th oblong number, contains exactly n 6's.at n=4A048541