Properties of the Number -27903

Twenty-Seven Thousand Nine Hundred Three

Basics

Value: -27904 → -27903 → -27902

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 71 × 131

Divisors: 1, 3, 71, 131, 213, 393, 9301, 27903

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -110110011111111

Octal: -66377

Duodecimal: -14193

Hexadecimal: -6cff

Square: 778577409

Square Root: 167.04191090861

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

Number of ways to choose a set partition of a strict integer partition of n. A294617

Numbers n such that p(6n) is prime, where p(n) is the number of partitions of n. A111036

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 1 and no antidiagonal sum 1 and no row sum 0 or 1 and no column sum 0 or 1. A255159

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 149", based on the 5-celled von Neumann neighborhood. A279180

Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 169", based on the 5-celled von Neumann neighborhood. A286174

If a(n-1) is not a prime, then a(n) = 2·a(n-1) + S; otherwise set S = -S and a(n) = prime(n) + S; start with a(1) = S = 1. A373805

G.f. A(x) satisfies A(x) = 1/((1 - x·A(x)³) * (1 - x·A(x))²). A379186

Number of hexagonal n-element polyominoes whose graph is a nonextensible path. A383731

Fibonacci sequence beginning 4, 15. A22133

a(n) = 6·Lucas(2n) - Fibonacci(2n+2). A97512