Properties of the Number 27302

Twenty-Seven Thousand Three Hundred Two

Basics

Value: 27301 → 27302 → 27303

Parity: even

Prime: No

Previous Prime: 27299

Next Prime: 27329

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 11 × 17 × 73

Divisors: 1, 2, 11, 17, 22, 34, 73, 146, 187, 374

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110101010100110

Octal: 65246

Duodecimal: 13972

Hexadecimal: 6aa6

Square: 745399204

Square Root: 165.2331685830663

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

Take n points in general position in the plane; draw all the (infinite) straight lines joining them; sequence gives number of connected regions formed. A55503

Relative of Hofstadter Q-sequence: a(n) = max(0, n+27298) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 0. A283888

Rectangular array A read by upward antidiagonals in which the entry in row n and column k is defined by A(n,k) = (2^a(n)*(6·k - (3 - (-1)^a(n))*(1 - (-1)ⁿ)/2) - 2ⁿ + 4)/6, n,k >= 1, where {a(n)} is the Beatty sequence A117630 defined by a(n) = floor(n·log(3)/log(3/2)). A254312

Values of n associated with A033705. A33707

Number of partitions of n such that (greatest part) <= (multiplicity of least part). A240182

Numbers that are 4-digit palindromes in at least 2 bases. A180453

Numbers n such that φ(n) = 2*φ(n-2). A258454

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 3", based on the 5-celled von Neumann neighborhood. A269912

G.f. A(x) satisfies: 1 + x = P(A(x)) / Q(A(x)), where P(x) = ∏_n>=0 (1 + x^5·n+1)*(1 + x^5·n+4) and Q(x) = ∏_n>=0 (1 + x^5·n+2)*(1 + x^5·n+3), with A(0) = 0, A'(0) = 1. A351634

a(n) = ∑_{k=0..floor((n-1)/2)} T(n,k) * T(n,k+1), with T given by A008315. A27302