Properties of the Number -27209

Twenty-Seven Thousand Two Hundred Nine

Basics

Value: -27210 → -27209 → -27208

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 7 × 13 ² × 23

Divisors: 1, 7, 13, 23, 91, 161, 169, 299, 1183, 2093

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -110101001001001

Octal: -65111

Duodecimal: -138B5

Hexadecimal: -6a49

Square: 740329681

Square Root: 164.95150802584376

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

a(n) = (2·n - 1)*(11·n² - 11·n + 6)/6. A63492

Standard composition numbers of compositions whose maximal runs all belong to {(1), (2,2), (3,3,3), ...}. A389530

a(1) = 1; set of digits of a(n)² is a subset of the set of digits of a(n+1)². A66825

Greatest number m such that the fractional part of (π-2)^A153717(n) <= 1/m. A153721

a(n) = ∑_k=1..n (-1)^k+1 * floor(n/k)³. A344721

For any number n > 0, let f(n) be the function that associates k to the prime(k)-adic valuation of n (where prime(k) denotes the k-th prime); f establishes a bijection between the positive numbers and the arithmetic functions with nonnegative integer values and a finite number of nonzero values; let g be the inverse of f; a(n) = g(f(n) * f(n)) (where i·j denotes the Dirichlet convolution of i and j). A296857

Principal diagonal of the convolution array A212891. A213436

Number of permutations p of [n] such that 0p has a nonincreasing jump sequence beginning with four. A292170

a(n) = (10n+1)*(10n+9). A1535

a(n) = 1·binomial(n,2) + 3·binomial(n,3) + 6·binomial(n,4) + 10·binomial(n,5). A361474