Properties of the Number 19256

Nineteen Thousand Two Hundred Fifty-Six

Basics

Value: 19255 → 19256 → 19257

Parity: even

Prime: No

Previous Prime: 19249

Next Prime: 19259

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ³ × 29 × 83

Divisors: 1, 2, 4, 8, 29, 58, 83, 116, 166, 232

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101100111000

Octal: 45470

Duodecimal: B188

Hexadecimal: 4b38

Square: 370793536

Square Root: 138.76599006961325

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

Iterates of A122237, starting from 4. A122241

Number of quadrilaterals in the graph formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares). A332607

Number of multisets of nonempty words with a total of n letters over nonary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter. A293739

Number of binary strings of length 2n that contain the ones' complements and the reversals of each of their two halves. A237502

Total runs-resistance of all binary vectors of length n. A319415

Total number of modes in all partitions of n. A372542

Partial sums of A033485. A178855

Number of n X 3 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 1 vertically. A207584

Rising diagonal sums of triangle of Fibonacci polynomials (rows displayed as centered text). A227300

The number of P-positions in the game of Nim with up to five piles, allowing for piles of zero, such that the total number of objects in all piles doesn't exceed 2n. A238147