Properties of the Number 14391

Fourteen Thousand Three Hundred Ninety-One

Basics

Value: 14390 → 14391 → 14392

Parity: odd

Prime: No

Previous Prime: 14389

Next Prime: 14401

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 13 × 41

Divisors: 1, 3, 9, 13, 27, 39, 41, 117, 123, 351

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11100000110111

Octal: 34067

Duodecimal: 83B3

Hexadecimal: 3837

Square: 207100881

Square Root: 119.96249413879323

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·n-1)*(5·n²-5·n+6)/6. A63489

-9-Knödel numbers. A225513

Maximum value of the cyclic convolution of first n primes with themselves. A299111

Numbers n = concat(a,b) such that φ(n) = φ(a) * φ(b), where φ = A000010. A147619

a(n) = (n-1)*(2·n-1)*(3·n-1). A33594

a(n) = (n+1)*(9-9·n+5·n²-n³). A157371

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k double descents and initial descents (n>=0; 0<=k<=max(0,n-1)) [we say that i is a doubledescent of a permutation p if p(i) > p(i+1) > p(i+2); we say that a permutation p has an initial descent if p(1) > p(2)]. A162976

Number of unlabeled rooted trees with n nodes and maximal outdegree (branching factor) 3. A244399

Numbers k such that k and k+1 both have 16 divisors. A274359

Numbers k that divide the (left) concatenation of all numbers <= k written in base 19 (most significant digit on left). A29488