Properties of the Number 16601

Sixteen Thousand Six Hundred One

Basics

Value: 16600 → 16601 → 16602

Parity: odd

Prime: No

Previous Prime: 16573

Next Prime: 16603

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 13 × 1277

Divisors: 1, 13, 1277, 16601

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100000011011001

Octal: 40331

Duodecimal: 9735

Hexadecimal: 40d9

Square: 275593201

Square Root: 128.84486796143648

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

Trajectory of n under the Reverse and Add! operation carried out in base 2 does not reach a palindrome and (presumably) does not join the trajectory of any term m < n. A75252

Diagonal in array of n-gonal numbers A081422. A81435

Array read by upwards antidiagonals: T(m,n) = number of set partitions of the multiset consisting of one copy each of x₁, x₂, ..., x_m, and two copies each of y₁, y₂, ..., y_n, for m >= 0, n >= 0. A322765

a(n) is the smallest number which can be represented as the sum of n distinct nonzero squares in exactly n ways, or 0 if no such number exists. A350241

a(n) = (n+1)*(n⁴-4·n³+11·n²-8·n+12)/12. A302612

Sum of the third largest parts of the partitions of n into 5 parts. A308825

Values of w(k) when w(k-2), w(k-1), and w(k) are all odd, where w is A336957. A338071

Row 2 of array in A322765. A322767

Number of partitions of the (n+4)-multiset {1,2,...,n,1,2,3,4}. A346881

Number of partitions of the (n+6)-multiset {1,2,...,n,1,2,...,6}. A346883