Properties of the Number 27050

Twenty-Seven Thousand Fifty

Basics

Value: 27049 → 27050 → 27051

Parity: even

Prime: No

Previous Prime: 27043

Next Prime: 27059

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 5 ² × 541

Divisors: 1, 2, 5, 10, 25, 50, 541, 1082, 2705, 5410

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110100110101010

Octal: 64652

Duodecimal: 137A2

Hexadecimal: 69aa

Square: 731702500

Square Root: 164.46884203398528

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 integer partitions of n containing all of their distinct multiplicities. A325705

Numbers k such that σ(k) mod π(k) = 1. A73723

a(0) = 1; a(n) = (1/n) * ∑_k=2..n (binomial(n,k) * k!)² * a(n-k) / k. A346291

Triangle read by rows, with T(n,k) giving the number of n X n Boolean matrices with exactly k ones that have no zero rows and at least one zero column. A392482

a(n) = n*(6·n² + 15·n + 5)/2. A163833

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

a(n) = start of a sequence of at least n consecutive primes, p₁, p₂, ..., p_n (say), all == 1 mod 4, such that A(p₁) > A(p₂) > ... > A(p_n), where A(p) (see A145010) is the area of the Pythagorean triangle with hypotenuse p. A144954

a(n) = T(n,2n-1), T given by A027023. A27050