Properties of the Number 16696

Sixteen Thousand Six Hundred Ninety-Six

Basics

Value: 16695 → 16696 → 16697

Parity: even

Prime: No

Previous Prime: 16693

Next Prime: 16699

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 2087

Divisors: 1, 2, 4, 8, 2087, 4174, 8348, 16696

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 100000100111000

Octal: 40470

Duodecimal: 97B4

Hexadecimal: 4138

Square: 278756416

Square Root: 129.21300244170476

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+5)X(k+5) 0..1 matrices with each 6X6 subblock idempotent. A224577

Expansion of ∏_k>=1 1 / ((1-x^3·k-1)^3·k-1 * (1-x^3·k-2)^3·k-2). A262923

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 2, 3 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A317871

Numbers k such that 7·2^k+1 is prime. A32353

a(0)=0; for n>0, a(n) = ∑_d∣n d·2^n/d. A54598

a(n) is the number of integers·that can be written x = (2^c(1) - 2^c(2) - 3·2^c(3) - 3²*2^c(4) - ... - 3^m-2*2^c(m) - 3^m-1) / 3^m for integers c(1), c(2), ..., c(m) such that n = c(1) > c(2) > ... > c(m) > 0 and c(1) - c(2) ≠ 2 if m >= 2. A131450

Triangle read by rows: T(m,n) (m >= n >= 1) = number of edges formed by drawing the line segments connecting any two of the (m+1) X (n+1) lattice points in an m X n grid of squares and extending them to the boundary of the grid. A333283

a(n) = (27·n² + 9·n + 2)/2. A93485

Records in A139251. A152768

a(n) is the smallest term m in A173978 for which A020639(2m-3) = prime(n), n > 1. A173980