Properties of the Number 5983

Five Thousand Nine Hundred Eighty-Three

Basics

Value: 5982 → 5983 → 5984

Parity: odd

Prime: No

Previous Prime: 5981

Next Prime: 5987

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 31 × 193

Divisors: 1, 31, 193, 5983

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011101011111

Octal: 13537

Duodecimal: 3567

Hexadecimal: 175f

Square: 35796289

Square Root: 77.34985455707076

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

Partial sums of A299254. A299260

Partial sums of A299258. A299264

Expansion of (1 - x)/(1 - 2·x + 3·x²) in powers of x. A87455

a(n) = a(n-1) - 2·a(n-2) with a(0) = 2, a(1) = 1. A2249

Fourth column (r=3) of FS(3) staircase array A062745. A62748

Fibonacci(p-J(p,5)) mod p², where p is the n-th prime and J is the Jacobi symbol. A113650

Let φ = arccos(1/3), the dihedral angle of the regular tetrahedron. Then cos(n*φ) = a(n)/3ⁿ. A25172

Odd composite integers m such that A003501(m-J(m,21)) == 2 (mod m) and gcd(m,21)=1, where J(m,21) is the Jacobi symbol. A339130

a(n) is the unique odd positive solution y of 2ⁿ = 7x² + y². A77021

Odd composite integers m such that A004254(m-J(m,21)) == 0 (mod m) and gcd(m,21)=1, where J(m,21) is the Jacobi symbol. A340098