Properties of the Number -13797

Thirteen Thousand Seven Hundred Ninety-Seven

Basics

Value: -13798 → -13797 → -13796

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 7 × 73

Divisors: 1, 3, 7, 9, 21, 27, 63, 73, 189, 219

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11010111100101

Octal: -32745

Duodecimal: -7B99

Hexadecimal: -35e5

Square: 190357209

Square Root: 117.46063170271135

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

Number of n-bead necklaces with beads of 2 colors and primitive period n, when turning over is not allowed but the two colors can be interchanged. A48

Fermat quotients: (2^p-1-1)/p, where p=prime(n). A7663

Number of binary Lyndon words with an even number of 1's. A51841

Array (a frieze pattern) defined by a(n,k) = (a(n-1,k)*a(n-1,k+1) - 1) / a(n-2,k+1), read by antidiagonals. A7754

Maximum cycle length in differentiation digraph for n-bit binary sequences. A38553

Number of n-bead necklace structures using exactly two different colored beads. A56295

Number of Hamiltonian cycles in the directed graph with 2n nodes {0..2n-1} and edges from each i to 2i (mod 2n) and to 2i+1 (mod 2n). A27362

Number of primitive (period n) n-bead necklace structures using exactly two different colored beads. A56303

Ultra-useful primes: smallest k such that 2^2ⁿ - k is prime. A58220

Numbers k such that φ(k) is a perfect 5th power. A78165