Properties of the Number 27242

Twenty-Seven Thousand Two Hundred Forty-Two

Basics

Value: 27241 → 27242 → 27243

Parity: even

Prime: No

Previous Prime: 27241

Next Prime: 27253

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 53 × 257

Divisors: 1, 2, 53, 106, 257, 514, 13621, 27242

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110101001101010

Octal: 65152

Duodecimal: 13922

Hexadecimal: 6a6a

Square: 742126564

Square Root: 165.05150711217394

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

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum 3 or 6 and every diagonal and antidiagonal sum not 3 or 6. A251779

Expansion of g.f.: (1+x-sqrt(1-2·x-7·x²-8·x³-4·x⁴))/(2*(1+x+x²)). A108630

Number of (n+2) X (1+2) 0..3 arrays with every 3 X 3 subblock row and column sum 3 or 6 and every diagonal and antidiagonal sum not 3 or 6. A251772

Number of (n+2)X(6+2) 0..3 arrays with every 3X3 subblock row and column sum 3 or 6 and every diagonal and antidiagonal sum not 3 or 6. A251777

Least inverse of A073454: Smallest m such that m divided by the primes up to m have exactly n repeated residues. A274320

Number of repeated remainders arising when n is divided by all primes up to n: a(n) = π(n) - A073453(n). A73454

Number of decompositions of 2n into a sum of two primes p2 >= p1 such that the number of runs in binary expansion of p2-p1 is less than or equal to 4. A230443

a(n) = ∑_k=0..n-3 T(n,k) * T(n,k+3), with T given by A026769. A27242