Properties of the Number 65790

Sixty-Five Thousand Seven Hundred Ninety

Basics

Value: 65789 → 65790 → 65791

Parity: even

Prime: No

Previous Prime: 65789

Next Prime: 65809

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 5 × 17 × 43

Divisors: 1, 2, 3, 5, 6, 9, 10, 15, 17, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000000011111110

Octal: 200376

Duodecimal: 320A6

Hexadecimal: 100fe

Square: 4328324100

Square Root: 256.49561399758863

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 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4. A240412

Number of n-bead black-white reversible strings with fundamental period n. A45625

Number of reversible strings with n beads using exactly two different colors. A56309

a(n) = 2*(2ⁿ + 1)*(2ⁿ⁺¹ - 1). A5367

First of two complementary trees generated by the squares; the other tree is A183421. A183420

Those primitive elements of A337386 that have exactly one primitive nondeficient divisor (A006039). A341604

Number of primitive (aperiodic) reversible strings with n beads using exactly two different colors. A56318

Number of 3Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4. A240414

Number of (n+1) X (7+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nonincreasing x(i,j)-x(i-1,j) in the j direction. A250741

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nonincreasing x(i,j)-x(i-1,j) in the j direction. A250742