Properties of the Number 15688

Fifteen Thousand Six Hundred Eighty-Eight

Basics

Value: 15687 → 15688 → 15689

Parity: even

Prime: No

Previous Prime: 15683

Next Prime: 15727

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 37 × 53

Divisors: 1, 2, 4, 8, 37, 53, 74, 106, 148, 212

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11110101001000

Octal: 36510

Duodecimal: 90B4

Hexadecimal: 3d48

Square: 246113344

Square Root: 125.25174649480941

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

a(n) = 5ⁿ + 2ⁿ - 1ⁿ. A155588

Consecutive internal states of the linear congruential pseudo-random number generator (281·s + 28411) mod 134456 when started at 1. A383126

T(n,k) = Number of (n+1) X (k+1) 0..4 arrays with the permanents of all 2X2 subblocks equal and nonzero. A204732

Sum of all the parts in the partitions of n into 8 squarefree parts. A326444

T(n,k)=Number of nXk 0..3 arrays with the row and column sums nondecreasing. A202581

Imaginary part of absolute Gaussian perfect numbers, in order of increasing magnitude. A102532

a(n) = dot_product(1,2,...,n)*(4,5,...,n,1,2,3). A26040

Low temperature energy function for square lattice. A2909

The smallest number in base n such that two digits (and no fewer) need to be changed to get a prime. A370531

Integers k equal to the sum over A024816(t) mod t, for some steps, starting with t = k and then using the result to feed the next calculation. A377002