8249
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8436
- Proper Divisor Sum (Aliquot Sum)
- 187
- 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
- 8064
- Möbius Function
- 1
- Radical
- 8249
- 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
- 65
- 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
- Pseudoprimes to base 95.at n=30A020223
- Strong pseudoprimes to base 95.at n=5A020321
- Numbers k such that the continued fraction for sqrt(k) has period 25.at n=25A020364
- a(n+1) = [ A*a(n)+B ]/p^r, where p^r is the highest power of p diving [ A*a(n)+B ] and p=2, A=2.00013, B=3.0.at n=41A029580
- Multiplicity of highest weight (or singular) vectors associated with character chi_188 of Monster module.at n=38A034576
- Numbers n such that 169*2^n-1 is prime.at n=17A050836
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 23.at n=15A051988
- a(n) = lcm(A051612(n), A065387(n)), where A051612(n) = sigma(n) - phi(n) and A065387(n) = sigma(n) + phi(n).at n=49A077100
- Triangle T(n,k), 0<=k<=n, read by rows, defined by: T(n,k)=0 if k>n, T(n,0) = A000108(n); T(n+1,k)= Sum_{j=0..n} T(n-j,k-1)*binomial(2j+1,j+1).at n=50A090285
- Iccanobirt prime indices (11 of 15): Indices of prime numbers in A102121.at n=15A102141
- Positive integers of the form (18*m^2+1)/11.at n=12A113338
- Number of ordered trees with n edges and no unary or binary nodes.at n=15A114997
- Number of compositions of n with parts in N which avoid the adjacent pattern 111.at n=15A128695
- Positive numbers y such that y^2 is of the form x^2+(x+761)^2 with integer x.at n=5A160200
- a(n) = 16*a(n-1) - 59*a(n-2) for n > 1; a(0) = 1, a(1) = 9.at n=4A163308
- Numbers k that divide the sum of digits of 13^k.at n=26A175525
- Positive integers of the form (2*m^2+1)/11.at n=38A179088
- Product of exactly two distinct primes congruent to 1 mod 8 (A007519).at n=27A185377
- G.f.: exp( Sum_{n>=1} A000984(n)*A000172(n) * x^n/n ), which involves central binomial coefficients (A000984) and Franel numbers (A000172).at n=4A199813
- Number of zero-sum -n..n arrays of 4 elements with adjacent element differences also in -n..n.at n=15A202254