Properties of the Number 27020

Twenty-Seven Thousand Twenty

Basics

Value: 27019 → 27020 → 27021

Parity: even

Prime: No

Previous Prime: 27017

Next Prime: 27031

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 5 × 7 × 193

Divisors: 1, 2, 4, 5, 7, 10, 14, 20, 28, 35

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100110001100

Octal: 64614

Duodecimal: 13778

Hexadecimal: 698c

Square: 730080400

Square Root: 164.37761404765553

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 ways to place 4 nonattacking queens on a 4 X n board. A61990

Numbers n such that Maple 9.5, Maple 10, Maple 11 and Maple 12 give the wrong answers for the number of partitions of n. A110375

a(n) = 1000·n + 20. A157510

Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of ∏_j>=1 1/(1 - j·x^j)^{j^k}. A294589

G.f.: sqrt( 1 + ∑_n>=1 4·x^n² ). A223027

Triangular array read by rows. T(n,k) is the number of n X n matrices over GF(2) such that the sum of the dimensions of their eigenspaces taken over all eigenvalues is k, 0 <= k <= n, n >= 0. A346201

Triangular array read by rows: T(n,k) is the number of partial order relations on [n] that have exactly k components, n>=0, 0<=k<=n. A352399

Triangle read by rows: T(n,k) is the number of partitions of a 4-colored set of n objects into exactly k parts with 0 <= k <= n. A382341

a(n) = greatest number in row n of array T given by A027011. A27020