4282
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6426
- Proper Divisor Sum (Aliquot Sum)
- 2144
- 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
- 2140
- Möbius Function
- 1
- Radical
- 4282
- 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
- 25
- 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 partitions of n into partition numbers.at n=47A007279
- Coordination sequence T4 for Zeolite Code FER.at n=40A008109
- If a, b in sequence, so is ab+6.at n=38A009307
- Numbers k such that the continued fraction for sqrt(k) has period 37.at n=12A020376
- Numbers having period-6 5-digitized sequences.at n=27A031190
- "DHK[ 6 ]" (bracelet, identity, unlabeled, 6 parts) transform of 1,1,1,1,...at n=17A032247
- Number of binary [ n,7 ] codes of dimension <= 7 without zero columns.at n=10A034341
- Number of partitions satisfying 0 < cn(2,5) + cn(3,5).at n=29A039897
- Numbers having three 7's in base 9.at n=5A043483
- Positive numbers whose product of digits is 8 times their sum.at n=39A062040
- a(n) = A000203(n)^2 - A001157(n) - 2n = sigma(n)^2 - sigma_2(n) - 2n.at n=61A066294
- a(0)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)= 1/a(0)+1/a(1)+1/a(2)+...+1/a(n) equals 2n.at n=36A070898
- Triangle T(n,k), read by rows, giving the total number of inequivalent binary linear [n,i] codes with no column of zeros, summed for i <= k (n >= 1, 1 <= k <= n).at n=61A076832
- In base 4, smallest number that requires n Reverse and Add! steps to reach a palindrome.at n=34A077441
- Numbers k such that for any positive integers (a, b), if a * b = k then a + b is prime.at n=53A080715
- a(n) = sum of the first n lower twin primes.at n=23A086167
- Semiprime function n -> A001358(n) applied four times to n.at n=35A105998
- Semiprimes with even digits.at n=44A108636
- a(n) = -1 + Sum_{i=0..n} 2^i*i!.at n=5A112369
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k columns ending at an even level (1<=k<=n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=33A121698