Properties of the Number 14233

Fourteen Thousand Two Hundred Thirty-Three

Basics

Value: 14232 → 14233 → 14234

Parity: odd

Prime: No

Previous Prime: 14221

Next Prime: 14243

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 43 × 331

Divisors: 1, 43, 331, 14233

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011110011001

Octal: 33631

Duodecimal: 82A1

Hexadecimal: 3799

Square: 202578289

Square Root: 119.30213744941874

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

Maximal number of pieces obtained by slicing a torus (or a bagel) with n cuts: (n³ + 3·n² + 8·n)/6 (n > 0). A3600

Smallest semiprime (A001358) which is at the end of an arithmetic progression of n semiprimes. A96003

a(n) = n * ∑_d∣n binomial(d+2,3)/d. A343544

Least number that ends an arithmetic progression of n numbers with the same prime signature. A87309

Expansion of sum ( qⁿ / product( 1-q^k, k=1..5·n), n=0..inf ). A35297

Least number that ends an arithmetic progression of n numbers with the same number of divisors. A90548

Define two triangular arrays by: B(0,0)=C(0,0)=1, B(0,r)=C(0,r)=0 for r>0, C(t,-1)=C(t,0); and for t,r >= 0, B(t+1,r)=C(t,r-1)+2C(t,r)-B(t,r), C(t+1,r)=B(t+1,r)+2B(t+1,r+1)-C(t,r). Sequence gives array C(t,r) read by rows. A177020

a(n) = -1 + 5·n/6 + n³/6. A283551

a(n) is the numerator of ∑_k=1..n 1 / (k·k!). A353545

Number of base 11 circular n-digit numbers with adjacent digits differing by 2 or less. A124857