Properties of the Number 14481

Fourteen Thousand Four Hundred Eighty-One

Basics

Value: 14480 → 14481 → 14482

Parity: odd

Prime: No

Previous Prime: 14479

Next Prime: 14489

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 1609

Divisors: 1, 3, 9, 1609, 4827, 14481

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11100010010001

Octal: 34221

Duodecimal: 8469

Hexadecimal: 3891

Square: 209699361

Square Root: 120.33702672078948

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

Number of partitions of n such that (least part) < (multiplicity of greatest part). A240178

Number of partitions of n such that 4*(smallest part) = (number of parts). A350896

Number of primes less than 10ⁿ with digits in nondecreasing order. A345325

Expansion of 1/((1-x)*(1-2·x)*(1-5·x)*(1-8·x)). A21129

A version of F. K. Hwang's sequence in {3·k, 3·k+1, 3·k+2}. A123945

Number of 0..n arrays x(0..7) of 8 elements with zero 4th differences. A200331

G.f.: exp( ∑_n>=1 xⁿ/n * ∑_k=0..n binomial(n,k) * binomial(n²,k²) ). A207139

Numbers k such that the smallest k-digit odd number concatenated with the largest k-digit odd number is prime. A247182

a(n) = floor(A058303*(2^n-2+1/2)). A94393

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, -1), (0, 0, 1), (0, 1, 1), (1, 0, -1)}. A150040