Properties of the Number 27913

Twenty-Seven Thousand Nine Hundred Thirteen

Basics

Value: 27912 → 27913 → 27914

Parity: odd

Prime: No

Previous Prime: 27901

Next Prime: 27917

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 103 × 271

Divisors: 1, 103, 271, 27913

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110110100001001

Octal: 66411

Duodecimal: 141A1

Hexadecimal: 6d09

Square: 779135569

Square Root: 167.07184083501323

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

O.g.f.: A(x) = ∑_n>=0 xⁿ / ∏_k=0..n (1 - k²*x). A135920

Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-12). A23442

Numbers for which the root mean square of nontrivial divisors is an integer and which are not a square of prime numbers. A247137

a(n) = a(n-1) + a(n-2) + a(n-3), with a(0)=1, a(1)=4, a(2)=5. A354080

a(n) = floor(n!/σ(n)). A62359

Array read by downward antidiagonals: A(n,k) = (k+1)²*A(n-1,k) + A(n-1,k+1) with A(0,k) = 1, n >= 0, k >= 0. A369527

Array read by downward antidiagonals: A(n,k) = A(n-1,k+2) + ∑_j=0..k binomial(k,j)*A(n-1,j) with A(0,k) = 1, n >= 0, k >= 0. A369595

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (1, -1, 1), (1, 0, 1), (1, 1, -1)}. A148989

T(n,[ n/2 ]), T given by A027907. A27913