Properties of the Number 27912

Twenty-Seven Thousand Nine Hundred Twelve

Basics

Value: 27911 → 27912 → 27913

Parity: even

Prime: No

Previous Prime: 27901

Next Prime: 27917

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 1163

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 1163, 2326

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110110100001000

Octal: 66410

Duodecimal: 141A0

Hexadecimal: 6d08

Square: 779079744

Square Root: 167.0688480836568

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

Let A denote the sequence; A is equal to the union of the self-convolutions A² and A³, with terms in ascending order by size. A90845

Self-convolution cube of A090845. A222083

(k(n)!-j(n)!)/n, where (k!,j!) is the least pair of distinct factorials for which n divides k!-j!. A204937

G.f. A(x) satisfies: a([n/r²]) = [xⁿ] A(x)²/x and a([n/r³]) = [xⁿ] A(x)³/x², for n>=1, where r² + r³ = 1. A262990

Number of generalized mountain numbers (see A134853) with n digits. A178912

Expansion of x⁴*(1-3·x²-x³)/((1+x)*(1-2·x)*(1-x-2·x²)). A219755

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

E.g.f. (1+arctan(x))^arctan(x). A191471

Number of (undirected) paths in the n-book graph. A307921

Binomial coefficients C(2·n+9,9). A53138