Properties of the Number 68892

Sixty-Eight Thousand Eight Hundred Ninety-Two

Basics

Value: 68891 → 68892 → 68893

Parity: even

Prime: No

Previous Prime: 68891

Next Prime: 68897

Digit Sum: 33

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 5741

Divisors: 1, 2, 3, 4, 6, 12, 5741, 11482, 17223, 22964

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000110100011100

Octal: 206434

Duodecimal: 33A50

Hexadecimal: 10d1c

Square: 4746107664

Square Root: 262.47285573940786

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 (n+1) X (k+1) 0..2 arrays colored with the maximum plus the lower median of every 2 X 2 subblock. A236719

a(n) = σ(n)*Pell(n), where σ(n) = A000203(n), the sum of divisors of n. A204271

a(n) = [xⁿ] (x⁵ + 5·x⁴ + 4·x³ - 3·x + 1)/(x² + 2·x - 1)². A361732

Generating primitive Pythagorean triangles by using (n, n+1) gives perimeters for each n. This sequence lists the sum of these perimeters for each n triangles. A193068

Number of (n+1)X(3+1) 0..2 arrays colored with the maximum plus the lower median of every 2X2 subblock. A236714

Number of length n+5 0..3 arrays with every six consecutive terms having two times the sum of some two elements equal to the sum of the remaining four. A249080

Number of 2n-step walks on square lattice starting and ending at the origin with first step north and avoiding early returns. A366924

T(n,k) = Number of length n+5 0..k arrays with every six consecutive terms having two times the sum of some two elements equal to the sum of the remaining four. A249085

Quotients A005132(k)/k for k=A064568(n). A64569

Incorrect version of A085869. A68892