Properties of the Number 27931

Twenty-Seven Thousand Nine Hundred Thirty-One

Basics

Value: 27930 → 27931 → 27932

Parity: odd

Prime: No

Previous Prime: 27919

Next Prime: 27941

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 17 × 31 × 53

Divisors: 1, 17, 31, 53, 527, 901, 1643, 27931

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: Yes

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110110100011011

Octal: 66433

Duodecimal: 141B7

Hexadecimal: 6d1b

Square: 780140761

Square Root: 167.12570119523807

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 + 1. A53698

a(n) is the reverse concatenation of divisors of n. A176558

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically. A207729

Expansion of ∏_k>=1 1 / (1 - 5^k-1*x^k). A338674

a(n) = (30ⁿ - 1)/29. A218733

Numbers k such that A048138(k) is a prime and sets a new record for such primes. A64440

The least common multiple of 1+n and 1+n². A281660

Position of the first occurrence of (0, 1, ..., n-1) in the digits of π written in base n. A307582

a(n) is the number of reducible monic cubic polynomials x³ + r·x² + s·x + t with integer coefficients bounded by naïve height n (abs(r), abs(s), abs(t) <= n). A358398

Composite numbers n such that k! == 1 (mod n) for some k > 2. A49048