Properties of the Number 14545

Fourteen Thousand Five Hundred Forty-Five

Basics

Value: 14544 → 14545 → 14546

Parity: odd

Prime: No

Previous Prime: 14543

Next Prime: 14549

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 × 2909

Divisors: 1, 5, 2909, 14545

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11100011010001

Octal: 34321

Duodecimal: 8501

Hexadecimal: 38d1

Square: 211557025

Square Root: 120.60265337047937

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

Whitney number of level n of the lattice of the ideals of the fence of order 2n. A51286

A triangle formed like generalized Pascal's triangle. The rule is T(n,k) = 2·T(n-1,k-1) + T(n-1,k), the left border is n and the right border is n² instead of 1. A228576

a(n) is the smallest semiprime such that difference between a(n) and next semiprime, b(n), is n. A131109

Largest Whitney number of Fibonacci lattices J(Z_n). A77419

Binomial sums a(n) = ∑_k=0..n (binomial(2n-k,k))². A188648

Tennis ball problem: Balls 1 and 2 are thrown into a room; you throw one on lawn; then balls 3 and 4 are thrown in and you throw any of the 3 balls onto the lawn; then balls 5 and 6 are thrown in and you throw one of the 4 balls onto the lawn; after n turns, consider all possible collections on lawn and add all the values. A31970

Triangle read by rows: T(n,k) is the number of non-intersecting loops starting at (0,0) on the n X k torus consisting of steps up and to the right, 1 <= k <= n. A324604

a(d-2) is the smallest member of A046076 containing an undulating sequence of 010... or 101... of maximal length d=3, 4, ... A46077

Triangle of binomial sums read by rows: T(n,k) = sum(C(2n-2k-i,i) * C(2k-i,i), i=0..min(k,n-k)). A172991

Numbers n such that [A070080(n), A070081(n), A070082(n)] is an acute integer triangle with integer area. A70146