Properties of the Number 19425

Nineteen Thousand Four Hundred Twenty-Five

Basics

Value: 19424 → 19425 → 19426

Parity: odd

Prime: No

Previous Prime: 19423

Next Prime: 19427

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 ² × 7 × 37

Divisors: 1, 3, 5, 7, 15, 21, 25, 35, 37, 75

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101111100001

Octal: 45741

Duodecimal: B2A9

Hexadecimal: 4be1

Square: 377330625

Square Root: 139.37359864766353

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 consecutive nonsquares. A48395

Number of compositions of n with all adjacent parts (x, y) satisfying x > 2y or y = 2x. A342336

Triangle read by rows: T(n,k) is the number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2 or 3 (n >= 0, 0 <= k <= 3n). A144385

Sum of the n-th maximal run of adjacent (increasing by one at a time) non-perfect-powers. A375705

Row sums of the triangle in A199332. A199771

Triangle of 3-restricted Stirling numbers of the first kind (T(n,k), 0 <= k <= n), read by rows. A144633

Numbers k such that k-4, k-2, k+2 and k+4 are prime. A173037

Number of ways to write n as an ordered sum of 5 squarefree numbers. A341065

Triangle read by rows: a(n,k) = number of partitions of an n-set into exactly k nonempty subsets, each of size <= 3. A111246

a(n) = 10·binomial(7·n+10,n)/(7·n+10). A233908