Properties of the Number 14331

Fourteen Thousand Three Hundred Thirty-One

Basics

Value: 14330 → 14331 → 14332

Parity: odd

Prime: No

Previous Prime: 14327

Next Prime: 14341

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 17 × 281

Divisors: 1, 3, 17, 51, 281, 843, 4777, 14331

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011111111011

Octal: 33773

Duodecimal: 8363

Hexadecimal: 37fb

Square: 205377561

Square Root: 119.71215477135144

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 ordered triples (i,j,k) with |i|,|j|,|k|,|i·j*k| <= n and gcd(i,j,k) <= 1. A226357

Number of partitions of n such that (greatest part) - (least part) >= number of parts. A237834

Expansion of (1 - x + 5x²)/((1-x)*(1-2x)). A154118

Sums of 12 distinct powers of 2. A38463

Integers k such that nextprime(k⁵) - prevprime(k⁵) = 4. A90123

Coefficients of the A-Rogers mod 14 identity. A105780

a(n) = round(n*φ¹⁴), where φ is the golden ratio, A001622. A4949

Magnetic Tower of Hanoi, number of moves of disk number k, optimally solving the [RED ; NEUTRAL ; BLUE] pre-colored puzzle. A183113

Expansion of x⁴*(1-2·x+x⁴)/((1+x)*(1-2·x)²*(1-x-x²)). A219753

Number of -1..1 circular arrays x(0..n+1) of n+2 elements with zero sums of x(i) and x(i)*x((i+1) mod (n+2)). A201999