Properties of the Number 14836

Fourteen Thousand Eight Hundred Thirty-Six

Basics

Value: 14835 → 14836 → 14837

Parity: even

Prime: No

Previous Prime: 14831

Next Prime: 14843

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 3709

Divisors: 1, 2, 4, 3709, 7418, 14836

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11100111110100

Octal: 34764

Duodecimal: 8704

Hexadecimal: 39f4

Square: 220106896

Square Root: 121.8031198286809

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 integer partitions of n without any three parts (a,b,c) (repeats allowed) satisfying a + b = c. A variation of sum-free partitions. A364345

Numbers k such that 3^k - 34 is prime. A219051

Number of connected bowtie-free graphs on n nodes. A242792

Expansion of e.g.f. ∏_k>=1 (1 + x^k)^1/k!. A298906

Number of factorization patterns of polynomials of degree n over F₂. A6167

Let u(1)=u(2)=1, u(3)=2n, u(k) = abs(u(k-1)-u(k-2)-u(k-3)) and M(k) = Max_i<=i<=k u(i), then for any k >= A078109(n), M(k) = floor(sqrt(k + a(n))). A78108

L.g.f.: ∑_n>=1 a(n)*xⁿ/n = log( ∑_n>=0 x^2ⁿ-1 ). A162415

Number of nX6 0..1 arrays with every element equal to 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero. A298181

Number of asymmetric (identity) trees with n nodes and 6 leaves. A55337

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (-1, 1, 0), (0, -1, 1), (1, 0, -1), (1, 0, 0)}. A148719