Properties of the Number 16298

Sixteen Thousand Two Hundred Ninety-Eight

Basics

Value: 16297 → 16298 → 16299

Parity: even

Prime: No

Previous Prime: 16273

Next Prime: 16301

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 × 29 × 281

Divisors: 1, 2, 29, 58, 281, 562, 8149, 16298

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11111110101010

Octal: 37652

Duodecimal: 9522

Hexadecimal: 3faa

Square: 265624804

Square Root: 127.66362050325849

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 partitions of 5n such that cn(0,5) <= cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5). A36880

a(n) is the smallest index m such that ∑_k=2..m 1/PrimePi(k) >= n, where PrimePi()=A000720(). A74633

Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 429", based on the 5-celled von Neumann neighborhood. A282119

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 597", based on the 5-celled von Neumann neighborhood. A289764

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 605", based on the 5-celled von Neumann neighborhood. A289887

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + n·b(n-1), where a(0) = 2, a(1) = 4, b(0) = 1, b(1) = 3, and (a(n)) and (b(n)) are increasing complementary sequences. A296292

McKay-Thompson series of class 35A for Monster. A58640

Numbers k such that Fibonacci(k) == +-1 (mod k) and k is neither 1 nor prime nor twice a prime. A279072

Number of transitions necessary for a Turing machine to compute the differences between consecutive primes (primes written in unary), when using the instruction table below. A78612

Sum of the numbers of unitary divisors of the binomial coefficients C(n,k), k=0..n. A103445