Properties of the Number 14609

Fourteen Thousand Six Hundred Nine

Basics

Value: 14608 → 14609 → 14610

Parity: odd

Prime: No

Previous Prime: 14593

Next Prime: 14621

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 7 × 2087

Divisors: 1, 7, 2087, 14609

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11100100010001

Octal: 34421

Duodecimal: 8555

Hexadecimal: 3911

Square: 213422881

Square Root: 120.86769626331099

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 the prime parts in the partitions of n into 7 parts. A309468

Terms of Binary Gleichniszahlen-Reihe (BGR) sequence A045998 converted into decimal (Look and Say Sequence, mod 2, read in binary and converted to decimal). A48522

Triangle read by rows: T(k,n) (k >= 0, n = 0, ..., k) = number of tilings of a k X n rectangle using 2 X 2 tiles, right trominoes and dominoes. A354010

Number of upward triangles in a Star of David matchstick arrangement of size n. A45950

Triangle T(n, k) = ∑_j=0..k (-1)^k-j*A159041(2·n+1, j), read by rows. A225483

Number of tilings of a 3 X n rectangle using 2 X 2 tiles, right trominoes and dominoes. A354011

a(n) = prime(n)⁴ - 32. A153483

Triangle T(n, k) = prime(n)^k - 2^2·k-3 with T(n, 1) = prime(n), read by rows. A153488

Triangle T(n, k) = abs(A225483(n/2, k)) if (n mod 2 = 0), otherwise abs(A225482((n-1)/2, k) - A225483((n-1)/2, k-1)), read by rows. A225532

a(1) = 16. For n > 1, a(n) is the position of the first occurrence of a(n-1) after the decimal point in the decimal expansion of π. A247345