Properties of the Number 31706

Thirty-One Thousand Seven Hundred Six

Basics

Value: 31705 → 31706 → 31707

Parity: even

Prime: No

Previous Prime: 31699

Next Prime: 31721

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 83 × 191

Divisors: 1, 2, 83, 166, 191, 382, 15853, 31706

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111101111011010

Octal: 75732

Duodecimal: 16422

Hexadecimal: 7bda

Square: 1005270436

Square Root: 178.06178702910964

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

Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (4,n)-rectangular grid with k '1's and (4n-k) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other. A225812

Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (5,n)-rectangular grid with k '1's and (5n-k) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other. A228022

McKay-Thompson series of class 19A for Monster. A58549

Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and have k hills of the form ud (a hill is either a ud or a Udd starting at the x-axis). A108433

McKay-Thompson series of class 19A for the Monster group with a(0) = 3. A136569

Function A154470 iterated, starting from the initial value 31706. A154471

Number of nX3 0..1 arrays with exactly floor(nX3/2) elements unequal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..1 order. A222451

Number of walks within N² (the first quadrant of Z²) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, 0), (-1, 1), (0, -1), (0, 1), (1, 0)}. A151447

T(n,k) = Number of n X k 0..1 arrays with exactly floor(n X k/2) elements unequal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..1 order. A222456

Rewriting function for Wolfram's e[x_][y_] -> x[x[y]] symbolic system transformation, implemented on nihilistic S-expressions (parenthesizations) encoded by A014486. A154470