Properties of the Number -54085

Fifty-Four Thousand Eighty-Five

Basics

Value: -54086 → -54085 → -54084

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 × 29 × 373

Divisors: 1, 5, 29, 145, 373, 1865, 10817, 54085

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1101001101000101

Octal: -151505

Duodecimal: -27371

Hexadecimal: -d345

Square: 2925187225

Square Root: 232.56181973832247

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

T(n,k) = Number of (n+2) X (k+2) binary arrays with no more than two of any consecutive three bits set in any row or column. A202471

a(n+3) = 2·a(n+2) + 3·a(n+1) - a(n); with a(1) = 1, a(2) = 4, a(3) = 10. A95127

a(n) = Sum {k + j·m <= n} (k + j·m), with 0 < k,j,m <= n. A106847

Number of (n+2) X 3 binary arrays with no more than two of any consecutive three bits set in any row or column. A202464

Number of (n+2)X6 binary arrays with no more than two of any consecutive three bits set in any row or column. A202467

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 505", based on the 5-celled von Neumann neighborhood. A272583

Triangle read by rows: T(n,k) is the number of chains of nonempty partitions ordered by inclusion that end with a partition of n and have length k. A393310

Start with 1 and repeatedly reverse the digits and add 42 to get the next term. A118075

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, 1, 0), (0, 0, 1), (1, 0, -1), (1, 1, 1)}. A150801

Partition the decimal expansion of π into non-overlapping strings of length 10: 3141592653, 5897932384,..; a(n) is the position of the strings where digits are different from each other. A329368