6281
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6864
- Proper Divisor Sum (Aliquot Sum)
- 583
- 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
- 5700
- Möbius Function
- 1
- Radical
- 6281
- 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
- 62
- 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
- Positive integers n such that 2^n == 2^11 (mod n).at n=63A015935
- Pseudoprimes to base 90.at n=14A020218
- Strong pseudoprimes to base 90.at n=4A020316
- Numbers k such that the continued fraction for sqrt(k) has period 80.at n=20A020419
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 40 ones.at n=26A031808
- a(n) = 4*n^2 - 3*n + 1.at n=40A054552
- Semiprimes p1*p2 such that p2 mod p1 = 10, with p2 > p1.at n=35A064908
- Numbers k for which the sums of prime factors (ignoring multiplicity) of sigma(k) and phi(k) are equal but the sets of prime factors of sigma and phi are different.at n=21A081378
- Smallest n-digit triangular number - smallest n-digit number.at n=9A095865
- Expansion of (1-x+x^2)/(1-2x+2x^2-x^3-x^4).at n=26A096750
- Iccanobirt prime indices (13 of 15): Indices of prime numbers in A102123.at n=12A102143
- Semiprimes in A054552.at n=11A113690
- a(1) = 1; for n > 1, a(n) = smallest number > a(n-1) such that pairwise sums and (absolute) differences of distinct elements are all distinct.at n=44A126428
- a(n) = 280*C(n,9)+10*C(n,6)+6*C(n,4)+C(n,3)+1 where C = binomial.at n=9A144841
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 0111-1100-0111 pattern in any orientation.at n=15A147374
- a(n) = (n^3 + 4*n^2 - n)/2.at n=21A162260
- Principal diagonal of the convolution array A213838.at n=10A213839
- Number of n-digit 9th powers.at n=39A216659
- Let p = A002145(n) be the n-th prime of the form 4k+3, then a(n) is the smallest number such that p is the smallest prime of the form 4k+3 for which 4*a(n)+2-p is prime.at n=36A217696
- Number of partitions p of n such that mean(p) >= multiplicity(min(p)).at n=34A240079