Properties of the Number 19527

Nineteen Thousand Five Hundred Twenty-Seven

Basics

Value: 19526 → 19527 → 19528

Parity: odd

Prime: No

Previous Prime: 19507

Next Prime: 19531

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 23 × 283

Divisors: 1, 3, 23, 69, 283, 849, 6509, 19527

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100110001000111

Octal: 46107

Duodecimal: B373

Hexadecimal: 4c47

Square: 381303729

Square Root: 139.7390425042336

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

Sum of quadratic residues of (n-th prime == 3 mod 4). A282035

Number of arrays of median of three adjacent elements of some length-5 0..n array, with no adjacent equal elements in the latter. A229013

Let p = n-th prime == 3 mod 8; a(n) = sum of quadratic residues mod p. A282723

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 13 ones. A31781

4n²+1, 2n²+1, 2n²-1 are all prime. A55755

On a diagonally numbered square grid, with labels starting at 1, this is the number of steps that a (1,n) leaper makes before getting trapped when moving to the lowest available unvisited square, or -1 if it never gets trapped. A352730

a(n) = A159065(n+1) - A334701(n). A335677

Poincaré series [or Poincare series] for depths of roots in a certain root system. A19527