Properties of the Number 14305

Fourteen Thousand Three Hundred Five

Basics

Value: 14304 → 14305 → 14306

Parity: odd

Prime: No

Previous Prime: 14303

Next Prime: 14321

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 5 × 2861

Divisors: 1, 5, 2861, 14305

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011111100001

Octal: 33741

Duodecimal: 8341

Hexadecimal: 37e1

Square: 204633025

Square Root: 119.60351165413162

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

a(n) = 2^prime(n-1) mod prime(n)². A196202

a(n) = ∑_{k=0,1,2,...,n-4,n-2,n-1} a(k); a(n-3) is not a summand, with a(0)=a(1)=a(2)=1. A49864

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A318016

Number of ways to write n as an ordered sum of 5 prime powers (including 1). A341134

10-step Fibonacci sequence starting with 0,0,1,0,0,0,0,0,0,0. A251765

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A320402

Triangle read by rows: T(n,k) is the number of binary sequences of length n containing k subsequences 0110 (n,k >= 0). A118890

Number of lines through at least 2 points of a 10 X n grid of points. A160850

Numbers k such that 7·2^k - 3 is prime. A58593

Numbers m such that A076644(m) = floor((2/3)*m*(sqrt(m)+1)). A76660