Properties of the Number 14604

Fourteen Thousand Six Hundred Four

Basics

Value: 14603 → 14604 → 14605

Parity: even

Prime: No

Previous Prime: 14593

Next Prime: 14621

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 1217

Divisors: 1, 2, 3, 4, 6, 12, 1217, 2434, 3651, 4868

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11100100001100

Octal: 34414

Duodecimal: 8550

Hexadecimal: 390c

Square: 213276816

Square Root: 120.84701072016635

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) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A234882

Number of binary strings of length n with more 001 than 000 substrings. A371682

Pseudo-random numbers: MS C 6.0 version. A84275

Coefficient array of the second column of the inverse of the Riordan array ((1+(r+1)x)/(1+(r+2)x+rx²), x/(1+(r+2)x+rx²)). A188463

a(n) = ((-1)ⁿ*(2ⁿ-1) + ∑_k>=1 (kⁿ*(k²+k-1)/(k+2)!))/exp(1). A229091

Number of (n+1) X (2+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A234876

Number of length n+5 0..1 arrays with at most one downstep in every n consecutive neighbor pairs. A255996

Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 7 or 8 king-move adjacent elements, with upper left element zero. A305581

Numbers k such that 20^k - 3 is prime. A339922

Total sum of the 9th powers of lengths of ascending runs in all permutations of [n]. A228999