ℕ atory
Play Now

Properties of the Number 31688

Thirty-One Thousand Six Hundred Eighty-Eight

Basics

Value: 31687 → 31688 → 31689

Parity: even

Prime: No

Previous Prime: 31687

Next Prime: 31699

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 3 × 17 × 233

Divisors: 1, 2, 4, 8, 17, 34, 68, 136, 233, 466

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111101111001000

Octal: 75710

Duodecimal: 16408

Hexadecimal: 7bc8

Square: 1004129344

Square Root: 178.01123560045303

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

Starts of runs of 4 consecutive positive negabinary-Niven numbers (A331728). A331824
Number of rooted 2-connected loopless 4-regular planar maps with n inner faces. A99553
Triangle read by rows: T(n,k) = binomial(2n+1, n-k)*Fibonacci(2k+1), 0 <= k <= n. A103245
Solution of the complementary equation a(n) = 2·a(n-1) - a(n-3) + b(n-2), where a(0) = 2, a(1) = 4, a(2) = 6, b(0) = 1, b(1) = 3, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences. A295618
Numbers k such that sopfr(k) = τ(k)2. A305026
Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 89. A31767
Number of strings of numbers x(i=1..8) in 0..n with sum i3*x(i)2 equal to 512·n2. A184309
a(n) is the largest number that can be expressed as the sum of three triangular numbers in exactly n ways. A330810
Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 89. A31587
Number of walks within N3 (the first octant of Z3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 0), (0, 1, -1), (0, 1, 1), (1, 0, -1)}. A149332