ℕ atory
Play Now

Properties of the Number 14234

Fourteen Thousand Two Hundred Thirty-Four

Basics

Value: 14233 → 14234 → 14235

Parity: even

Prime: No

Previous Prime: 14221

Next Prime: 14243

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 11 × 647

Divisors: 1, 2, 11, 22, 647, 1294, 7117, 14234

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11011110011010

Octal: 33632

Duodecimal: 82A2

Hexadecimal: 379a

Square: 202606756

Square Root: 119.30632841555388

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) = C(n,1) + C(n,2) + C(n,3), or n*(n2 + 5)/6. A4006
Number of partitions p of n such that (number of even numbers in p) = (number of odd numbers in p). A241638
Numbers k such that 60·Rk + 7 is prime, where Rk = 11...1 is the repunit (A002275) of length k. A56657
Number of rooted identity trees on n nodes with thinning limbs. A124346
Maximum starting value of X such that repeated replacement of X with X-ceiling(X/6) requires n steps to reach 0. A279076
Numbers k such that φ(k) < φ(k+1) < φ(k+2) < φ(k+3) where φ is the Euler totient function (A000010). A327880
Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 22", based on the 5-celled von Neumann neighborhood. A269717
Number of growing self-avoiding walks with displacement n on a half-infinite strip of height 4 with a trapped endpoint. A374300
Numbers k, the smallest of at least 4 consecutive numbers x, for which φ(x) <= φ(x+1). A295865
The number of permutations of length n and tier at most 1, that is, the number of permutations of length n sortable by two passes through a stack where outputting the longest prefix matching the identity permutation is prioritized. A308726