Properties of the Number 76861

Seventy-Six Thousand Eight Hundred Sixty-One

Basics

Value: 76860 → 76861 → 76862

Parity: odd

Prime: No

Previous Prime: 76847

Next Prime: 76871

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 101 × 761

Divisors: 1, 101, 761, 76861

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10010110000111101

Octal: 226075

Duodecimal: 38591

Hexadecimal: 12c3d

Square: 5907613321

Square Root: 277.2381647609146

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

Strong pseudoprimes to base 39. A20265

Strong pseudoprimes to base 41. A20267

Integers k such that for all m>k, d(m)/m < d(k)/k where d(j) = Min_{p & q odd primes, 2·j = p+q, p <= q} (q-p)/2. A335297

T(n,k)=Number of (n+2)X(k+2) 0..4 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order. A252961

Number of geometries for group S_n under axioms A, 2T₁, CD. A76861

Number of 3 X n 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 3 X n array. A219916