Properties of the Number 56993

Fifty-Six Thousand Nine Hundred Ninety-Three

Basics

Value: 56992 → 56993 → 56994

Parity: odd

Prime: Yes

Previous Prime: 56989

Next Prime: 56999

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 56993

Divisors: 1, 56993

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101111010100001

Octal: 157241

Duodecimal: 28B95

Hexadecimal: dea1

Square: 3248202049

Square Root: 238.73206738936435

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

Coefficient of xⁿ in expansion of x/((1-x-x³)*(1-x)^n-1), also diagonal of A144903. A144904

Primes of the form 26k+1 generated recursively. Initial prime is 53. General term is a(n) = Min {p is prime; p divides (R¹³ - 1)/(R - 1); p == 1 (mod 13)}, where Q is the product of previous terms in the sequence and R = 13·Q. A125037

Primes of the form k² + k + 55661, with k >= 0. A116206

A triangular sequence of coefficients of polynomials: p(x,n)=(3*(x - 1)ⁿ*Sum[(((-1)ⁿ*(2·k + 1)^{n - 1}))*x^k, {k,0, Infinity}] -2*(x - 1)^{n + 1}*Sum[((-1)^{n + 1}*kⁿ)*x^k, {k, 0, Infinity}]/x). A154336

E.g.f.: sech(sin(arctan(x))) (even powers only). A12029

a(n) is the smallest k >= 2 such that k^2ⁿ+1 is prime, or -1 if no such k exists. A56993

Number of ways of placing n labeled balls into 9 indistinguishable boxes; word structures of length n using a 9-ary alphabet. A164863