Properties of the Number 15419

Fifteen Thousand Four Hundred Nineteen

Basics

Value: 15418 → 15419 → 15420

Parity: odd

Prime: No

Previous Prime: 15413

Next Prime: 15427

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 17 × 907

Divisors: 1, 17, 907, 15419

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11110000111011

Octal: 36073

Duodecimal: 8B0B

Hexadecimal: 3c3b

Square: 237745561

Square Root: 124.17326604386308

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 length-n 0..k arrays with no repeated value differing from the previous repeated value by more than one. A269583

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00001001 or 00100101. A260980

Number of intersection points formed by drawing the line segments connecting any two lattice points of an n X m convex lattice polygon written as triangle T(n,m), n >= 1, 1 <= m <= n. A288180

Number of integer partitions whose sum of primes of parts equals their sum of parts plus n. A331387

A three-dimensional version of the cellular automaton A160118, using cubes. A160119

Number of non-isomorphic n X n symmetric binary matrices with an equal number of ones in every row and column up to permutation of rows and columns. A333160

Number of (n+2) X (1+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000001 00001001 or 00100101. A260973

Number of length-n 0..2 arrays with no repeated value differing from the previous repeated value by more than one. A269578

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, -1, 1), (-1, 1, 0), (1, 0, -1), (1, 0, 1)}. A148745

Numbers m congruent to 5 mod 6 such that for all k >= 1 the numbers (m·4^k + 1)/3 are composite. A233551