Properties of the Number 14925

Fourteen Thousand Nine Hundred Twenty-Five

Basics

Value: 14924 → 14925 → 14926

Parity: odd

Prime: No

Previous Prime: 14923

Next Prime: 14929

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 ² × 199

Divisors: 1, 3, 5, 15, 25, 75, 199, 597, 995, 2985

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11101001001101

Octal: 35115

Duodecimal: 8779

Hexadecimal: 3a4d

Square: 222755625

Square Root: 122.16791722870616

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 nXk binary arrays without the pattern 0 0 diagonally or vertically. A188706

Number of compositions (ordered partitions) of n into distinct parts >= 3. A339101

Number of partitions in parts not of the form 13k, 13k+3 or 13k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 5 are greater than 1. A35951

a(n) = nonnegative value y such that (A155135(n), y) is a solution to the Diophantine equation x³+28·x² = y². A155137

a(n) = nonnegative value y such that (A155136(n), y) is a solution to the Diophantine equation x³+28·x² = y². A155138

a(k) such that A225258 column k of T(n,k) = n·k³ - a(k) for large n. A225263

p-INVERT of (0,1,0,1,0,1,...), where p(S) = 1 - 5 S + S². A291245

Square array read by antidiagonals: T(n,k) is the number of n-tuples of nonnegative integers, not all equal to 0, with a shortest vectorial addition chain of length k; n >= 1, k >= 0. A383333

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

Main diagonal of triangle A131791: a(n) = A131791(n,n) for n>=0. A131792