Properties of the Number 65802

Sixty-Five Thousand Eight Hundred Two

Basics

Value: 65801 → 65802 → 65803

Parity: even

Prime: No

Previous Prime: 65789

Next Prime: 65809

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 11 × 997

Divisors: 1, 2, 3, 6, 11, 22, 33, 66, 997, 1994

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000000100001010

Octal: 200412

Duodecimal: 320B6

Hexadecimal: 1010a

Square: 4329903204

Square Root: 256.5190051438684

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

T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nXk array. A219915

Composite numbers n such that if x = σ(n)-φ(n)-n then n = σ(x)-φ(x)-x. A238225

a(n) = n*(n⁴ + 10·n³ + 35·n² + 50·n + 144)/120. A51745

Number of 5Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 5Xn array. A219918

Numbers whose base-16 representation has exactly 5 runs. A43678

Number of nX7 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nX7 array. A219914

Number of discrete uninorms defined on the finite chain L_n={0,1,...n}, U:L_n²->L_n, whose underlying operators are smooth and idempotent, or smooth and idempotent-free. A366542

How small is the squeezed n-gon? Let s0 be the side of a regular n-gon and s1 the side of the maximal n-gon which can be squeezed between the former and its circumcircle. The n-th entry in the sequence is floor(s0/s1). A65802

Number of length-n 0..6 arrays with no repeated value differing from the previous repeated value by other than plus two, zero or minus 1. A269617