8257
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8640
- Proper Divisor Sum (Aliquot Sum)
- 383
- 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
- 7876
- Möbius Function
- 1
- Radical
- 8257
- 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
- 189
- Smith Number
- yes
- 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
- Numbers that are the sum of 4 positive 6th powers.at n=26A003360
- Numbers k such that the continued fraction for sqrt(k) has period 96.at n=15A020435
- Sum of squares of the first n primes.at n=13A024450
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/(2*n)} satisfy r < s, then r < k/m < (k+3)/m < s for some integer k.at n=33A024845
- Sum{T(n-k,k)}, 0<=k<=[ n/2 ], T given by A026670.at n=18A026680
- Denominators of continued fraction convergents to sqrt(931).at n=10A042801
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 4.at n=45A050053
- a(n) = (9*n^2 - 3*n + 2)/2.at n=43A080855
- a(n) = Sum_{2 <= p <= n, p prime} p^2.at n=42A081738
- a(n) = Sum_{2 <= p <= n, p prime} p^2.at n=45A081738
- a(n) = Sum_{2 <= p <= n, p prime} p^2.at n=44A081738
- a(n) = Sum_{2 <= p <= n, p prime} p^2.at n=43A081738
- Composite numbers k such that the continued fraction for k/m contains no 2 for any 1 <= m <= k.at n=32A082409
- Numbers k such that (89 + 10^(2*k+1))/99 is prime.at n=13A085512
- Riordan array ((1-x+sqrt(1-6x+x^2))/2, (1+x-sqrt(1-6x+x^2))/4).at n=57A117354
- A106486-encodings of combinatorial games with value 1.at n=34A125992
- Square array A(n,m), n>=0, m>=0, read by antidiagonals: A(n,m) = n-th number of the m-th iteration of the hyperbinomial transform on the sequence of 1's.at n=59A144303
- Products (semiprimes) of two distinct double-safe primes.at n=8A157356
- The Riordan square of the little Schröder numbers A001003.at n=29A172094
- Number of permutations of 1..n+4 with the number moved left exceeding the number moved right by n or more.at n=8A179579