Properties of the Number 93997

Ninety-Three Thousand Nine Hundred Ninety-Seven

Basics

Value: 93996 → 93997 → 93998

Parity: odd

Prime: Yes

Previous Prime: 93983

Next Prime: 94007

Digit Sum: 37

Digital Root: 1

Palindrome: No

Factorization: 93997

Divisors: 1, 93997

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10110111100101101

Octal: 267455

Duodecimal: 46491

Hexadecimal: 16f2d

Square: 8835436009

Square Root: 306.5893018355337

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

T(n,k) = Number of (n+2) X (k+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 1 2 4 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 1 2 4 6 or 7. A252558

Primes from merging of 6 successive digits in decimal expansion of Euler-Mascheroni constant. A198780

Balanced primes (A090403) of index 3. A96707

Primitive prime factors of the cyclotomic polynomial sequence φ(7,k) in the order in which they occur. A256146

Primes p such that 2·p⁵-+3 are also prime. A174368

Primes of the form 3n² + 10. A201480

Number of (n+2)X(3+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 1 2 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 1 2 4 6 or 7. A252553

Number of (6+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 1 2 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 1 2 4 6 or 7. A252564

Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 32. A31620

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 0), (-1, 1, -1), (0, 0, 1), (1, 0, 0)}. A149813