3082
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
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 4896
- Proper Divisor Sum (Aliquot Sum)
- 1814
- 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
- 1452
- Möbius Function
- -1
- Radical
- 3082
- 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
- 35
- 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
- Number of strict 5th-order maximal independent sets in cycle graph.at n=45A007393
- Numbers k such that the continued fraction for sqrt(k) has period 36.at n=37A020375
- a(n) = [ a(n-1)/a(1) ] + [ a(n-2)/a(2) ] + ... + [ a(1)/a(n-1) ], for n >= 3.at n=18A022864
- a(n) = least m such that if r and s in {1/1, 1/3, 1/5,..., 1/(2n-1)} satisfy r < s, then r < k/m < s for some integer k.at n=44A024819
- Sequence A025513 divided by 2.at n=36A025514
- Coordination sequence T1 for Zeolite Code TSC.at n=46A033616
- Number of partitions of n such that cn(0,5) = cn(2,5) < cn(1,5) < cn(3,5) = cn(4,5).at n=75A036860
- Coordination sequence for Zeolite Code DFT.at n=38A038408
- a(n) = (9*n^2 + 3*n + 2)/2.at n=26A038764
- Numbers n such that string 8,2 occurs in the base 10 representation of n but not of n-1.at n=33A044414
- Numbers n such that string 8,2 occurs in the base 10 representation of n but not of n+1.at n=33A044795
- Positions in decimal expansion of Pi where next prime begins.at n=13A053013
- a(n) = T(n,n-5), array T as in A055801.at n=25A055805
- Numbers k such that k | 11^k + 10^k + 9^k + 8^k + 7^k + 6^k + 5^k + 4^k + 3^k + 2^k + 1^k.at n=27A057292
- McKay-Thompson series of class 29A for Monster.at n=26A058611
- Numbers k that, when expressed in base 5 and then interpreted in base 6, give a multiple of k.at n=19A062928
- Numbers k such that the number of primes <= k is phi(phi(k)).at n=15A063999
- a(n) = min(x : x^2 + n^2 = 0 mod (x+n-1)).at n=39A066333
- a(n) = (p^2 - p + 2)/2 for p = prime(n); number of squares modulo p^2.at n=21A072205
- Numbers k such that for any positive integers (a, b), if a * b = k then a + b is prime.at n=47A080715