8297
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 8298
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 8296
- Möbius Function
- -1
- Radical
- 8297
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 39
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1042
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 67.at n=10A020406
- Primes of the form 36*n^2 - 810*n + 2753, n >= 0, sorted.at n=14A022464
- Primes that remain prime through 2 iterations of function f(x) = 8x + 1.at n=21A023260
- Primes with property that when squared all even digits occur together and all odd digits occur together.at n=43A030480
- Let a (resp. b,c,d) be number of primes in the range {2..p} that end in 1 (resp. 3,7,9); sequence gives p such that a=d and b=c.at n=44A038562
- a(n) = Sum_{k=1..n} T(n,k), array T as in A049790.at n=28A049791
- Primes of the form 36*k^2 - 810*k + 2753, listed in order of increasing parameter k >= 0.at n=14A050268
- Primes q of form q=10p+7, where p is also prime.at n=38A055783
- Numbers k such that (17^k + 1)/18 is a prime.at n=6A057183
- Primes p such that x^61 = 2 has no solution mod p.at n=18A059230
- Numbers k such that 81^k - 80^k is prime.at n=8A062647
- Primes p such that floor(p^Pi) is prime.at n=44A079594
- Numbers n which are prime and which when each digit is incremented by 2 with carries ignored yields another prime p with the same property.at n=46A088786
- Numbers which are primes and which remain prime for three successive applications of incrementing each digit by 2 with carries ignored.at n=12A088787
- Primes which are also prime if their base 32 representation is interpreted as a base 10 number.at n=41A090716
- Primes that represent some mean of 4 consecutive (2 smaller, itself, 1 larger) primes.at n=22A094932
- Primes with digit sum = 26.at n=36A106764
- Number of bipartite 2-connected outerplanar graphs on n unlabeled nodes.at n=17A111757
- a(0)=1, a(1)=1, a(n) = 9*a(n/2) for even n >= 2, and a(n) = 8*a((n-1)/2) + a((n+1)/2) for odd n >= 3.at n=23A116526
- a(n) = 36*n^2 - 810*n + 2753, producing the conjectured record number of 45 primes in a contiguous range of n for quadratic polynomials, i.e., abs(a(n)) is prime for 0 <= n < 44.at n=28A117081