Properties of the Number 65561

Sixty-Five Thousand Five Hundred Sixty-One

Basics

Value: 65560 → 65561 → 65562

Parity: odd

Prime: No

Previous Prime: 65557

Next Prime: 65563

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 53 × 1237

Divisors: 1, 53, 1237, 65561

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000000000011001

Octal: 200031

Duodecimal: 31B35

Hexadecimal: 10019

Square: 4298244721

Square Root: 256.0488234692751

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

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 197", based on the 5-celled von Neumann neighborhood. A286648

a(n) = n³ - 2·n² + 2. A100109

Semiprimes p·q such that p·q+p+q, p·q-(p+q), p·q+2*(p+q) and p·q-2*(p+q) are all primes. A356765

If the Collatz trajectory of n reaches 1, say after k steps, and there is an integer m > n such that Tⁱ(m) and Tⁱ(n) have the same parity for i = 0..k (where Tⁱ denotes the i-th iterate of the Collatz map A006370), then a(n) is the least such m, otherwise a(n) is -1. A348094

Number of 1-cop-win graphs of order n. A220840

a(1) = 1; for n >= 2, a(n) = (d(n)-1)-th highest positive integer that equals no a(k), 1 <= k < n, where d(n) is the number of positive divisors of n, A000005(n). A65561