Properties of the Number 27930

Twenty-Seven Thousand Nine Hundred Thirty

Basics

Value: 27929 → 27930 → 27931

Parity: even

Prime: No

Previous Prime: 27919

Next Prime: 27941

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 × 7 ² × 19

Divisors: 1, 2, 3, 5, 6, 7, 10, 14, 15, 19

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110110100011010

Octal: 66432

Duodecimal: 141B6

Hexadecimal: 6d1a

Square: 780084900

Square Root: 167.1227094083865

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) = n³ + n² + n. A27444

a(n) = n*(n+1)*(n+2)²/6. A4320

Expansion of (1-x)^-3 * (1-x²)^-2. A2624

Numbers n such that n*σ(n) is a perfect square. A69070

Triangle read by rows: T(n,k) (n >= 0, 1 <= k <= n+1) are the signed Hultman numbers. A189507

T(n,k)=Number of nXk binary arrays with every 1 immediately preceded by 0 0 to the left or above. A203108

Row squared sums of triangle of Lucas polynomials (A034807) for n>0: ∑_{k=0..floor(n/2)} A034807(n,k)², with a(0)=1. A132461

Numbers m such that the GCD of the x's that satisfy σ(x) = m is 4. A241649

Numbers n for which 2 < A257993(A276086(A276086(n))) < A257993(n), where A276086 converts the primorial base expansion of n into its prime product form, and A257993 returns the index of the least prime not present in its argument. A328762

a(n) is the number of subsets of {1..n} that contain exactly 1 odd and 3 even numbers. A330299