Properties of the Number 14232

Fourteen Thousand Two Hundred Thirty-Two

Basics

Value: 14231 → 14232 → 14233

Parity: even

Prime: No

Previous Prime: 14221

Next Prime: 14243

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 593

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 593, 1186

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011110011000

Octal: 33630

Duodecimal: 82A0

Hexadecimal: 3798

Square: 202549824

Square Root: 119.29794633605391

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) = T(2·n-1, n-2), where T is given by A026519. A26529

Expansion of ∑_k>=1 φ(k) * x^k/(1 - x^k)⁴, where φ = Euler totient function (A000010). A309323

Quotient of 'base-3' division described in A032537. A32538

Numerators of coefficients in quasimodular form F₃(q) of level 1 and weight 12. A126859

a(n) = 1728·n - 1320. A157263

Number of n-node rooted identity trees of height 9. A229403

Number of 2n-node rooted identity trees of height n. A245090

Nonnegative integers k such that k! mod nextprime(k) is larger than k. A360805

Number of partitions p of n such that the m(M(p)) is a part, where m = multiplicity, M = the maximum multiplicity of the parts of p. A240538

Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1, k) + 2·T(n-1, k-1) + 3·T(n-1, k-2) + 4·T(n-1, k-3) + 5·T(n-1, k-4) + 6·T(n-1, k-5) for k = 0..5·n; T(n,k)=0 for n or k < 0. A319092