Properties of the Number 27426

Twenty-Seven Thousand Four Hundred Twenty-Six

Basics

Value: 27425 → 27426 → 27427

Parity: even

Prime: No

Previous Prime: 27409

Next Prime: 27427

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 7 × 653

Divisors: 1, 2, 3, 6, 7, 14, 21, 42, 653, 1306

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110101100100010

Octal: 65442

Duodecimal: 13A56

Hexadecimal: 6b22

Square: 752185476

Square Root: 165.607970822663

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 primes <= the n-th Fibonacci number. A54782

Irregular table read by rows: T(n,k) is the number of k-sided polygons, for n>=1 and k>=3, in a hexagon when straight line segments connect the n-1 points between each corner that divide each edge into n equal parts to the n-1 points on the edge on the opposite side of the hexagon. A367665

Triangle read by rows. T(n, k) = 1 if k = 0, equals T(n, k-1) if k = n, and otherwise is (n - k + 1) * (2 * (n - k) + 1) * T(n, k - 1) + T(n - 1, k). A365672

Lower (1/2,1/3) midsequence of (n²) and (n³); see Comments. A389582

Expansion of g.f. 1/((1-x)*(1-2·x)*(1-7·x)). A16201

Number of primes < Fibonacci(n). A182564

G.f. A(x) satisfies: [xⁿ] A(x)ⁿ⁺¹ = [xⁿ] (1 + x·A(x)^2·n+3)ⁿ⁺¹ for n >= 0. A360347

Number of distinct products ijk with 0 <= i,j,k <= n. A27426

O.g.f. A(x) satisfies: 0 = [xⁿ] exp( n² * Integral 1/A(x)² dx ) / A(x), for n > 0. A305147

Cubes of the form semiprime(k) + k-th composite number. A112662