Properties of the Number 56697

Fifty-Six Thousand Six Hundred Ninety-Seven

Basics

Value: 56696 → 56697 → 56698

Parity: odd

Prime: No

Previous Prime: 56687

Next Prime: 56701

Digit Sum: 33

Digital Root: 6

Palindrome: No

Factorization: 3 × 18899

Divisors: 1, 3, 18899, 56697

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101110101111001

Octal: 156571

Duodecimal: 28989

Hexadecimal: dd79

Square: 3214549809

Square Root: 238.11131850460197

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

The smallest number such that n or more numbers k exist with k - a(n) = sopfr(k) + sopfr(a(n)), where sopfr(m) is the sum of the primes dividing m with repetition. A370352

a(n) = 9 + floor((3 + ∑_j=1..n-1 a(j))/4). A120167

Expansion of e.g.f. exp(sec(x)*arcsinh(x)). A12821

Numbers k such that φ(σ(k)+k) = σ(k). A68366

Number of binary strings of length n with equal numbers of 0010 and 0101 substrings. A164167

a(n) is the smallest number such that exactly n numbers k exist with k - a(n) = sopfr(k) + sopfr(a(n)), where sopfr(m) is the sum of the primes dividing m with repetition. A370356

sinh(sec(x)*arcsinh(x))=x+3/3!*x³+45/5!*x⁵+1071/7!*x⁷+56697/9!*x⁹... A12827

a(n) is least N > 1 congruent to -1,0, or 1 mod i for all i=1,...,n. A56697