Properties of the Number 56797

Fifty-Six Thousand Seven Hundred Ninety-Seven

Basics

Value: 56796 → 56797 → 56798

Parity: odd

Prime: No

Previous Prime: 56783

Next Prime: 56807

Digit Sum: 34

Digital Root: 7

Palindrome: No

Factorization: 13 × 17 × 257

Divisors: 1, 13, 17, 221, 257, 3341, 4369, 56797

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 1101110111011101

Octal: 156735

Duodecimal: 28A51

Hexadecimal: dddd

Square: 3225899209

Square Root: 238.32121181296472

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

Composite numbers k of the form 4u+1 for which the odd part of φ(k) divides k-1. A339870

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 597", based on the 5-celled von Neumann neighborhood. A283217

Numbers in which all pairs of consecutive base-4 digits differ by 2. A33082

a(0)=1, a(1)=1, a(n) = 13·a(n/2) for n=2,4,6,..., a(n) = 12·a((n-1)/2) + a((n+1)/2) for n=3,5,7,.... A116524

Base 4 digits are, in order, the first n terms of the periodic sequence with initial period 3,1. A37583

Numbers k such that 9·10^k+1 is prime. A56797

After 1, composite odd numbers, whose prime divisors, when multiplied together without carry-bits (as codes for GF(2)[X]-polynomials, with A048720), yield the same number back. A235040

If n is even, a(n) = a(n/2-1), and if n is odd, a(n) = a((n-1)/2) - a((n+1)/2), with a(1) = a(2) = 1. A277778