Properties of the Number 19596

Nineteen Thousand Five Hundred Ninety-Six

Basics

Value: 19595 → 19596 → 19597

Parity: even

Prime: No

Previous Prime: 19583

Next Prime: 19597

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 23 × 71

Divisors: 1, 2, 3, 4, 6, 12, 23, 46, 69, 71

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100110010001100

Octal: 46214

Duodecimal: B410

Hexadecimal: 4c8c

Square: 384003216

Square Root: 139.98571355677691

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+4)X(k+4) 0..2 matrices with each 5X5 subblock idempotent. A224625

a(n) = 16·n² - 4. A158443

Number of reduced 3 X 3 magilatin squares with magic sum n. A174020

G.f. satisfies: A(x) = 1 + x*( d/dx x·A(x) )³. A211824

Number of set partitions of [n] such that j is member of block b only if b = 1 or at least one of j-1, ..., j-3 is member of a block >= b-1. A287666

Number of partitions of n into colored blocks of equal parts, such that all colors from a set of size eight are used and the colors are introduced in increasing order. A327291

Number of unordered pairs of partitions of n with the same number of parts. A387259

Number of partitions satisfying (cn(0,5) = cn(1,5) = cn(4,5) and cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5)). A36824

Number of additive cyclic codes over GF(4) of length n that can be generated by one codeword. A143696

Number of (n+4)X6 0..2 matrices with each 5X5 subblock idempotent. A224619