Properties of the Number -70930

Seventy Thousand Nine Hundred Thirty

Basics

Value: -70931 → -70930 → -70929

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 5 × 41 × 173

Divisors: 1, 2, 5, 10, 41, 82, 173, 205, 346, 410

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10001010100010010

Octal: -212422

Duodecimal: -3506A

Hexadecimal: -11512

Square: 5031064900

Square Root: 266.32686683847726

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 binary sequences of length n with no initial repeats (or, with no final repeats). A122536

Start with any initial string of n numbers s(1), ..., s(n), with s(1) = 2, other s(i)'s = 2 or 3 (so there are 2^n-1 starting strings). The rule for extending the string is this as follows: To get s(n+1), write the string s(1)s(2)...s(n) as xy^k for words·and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence. Then a(n) = number of starting strings for which k = 1. A93371

a(n) is the number of interior points in the n-th figure shown in A255011 (meaning the figure with 4n points on the perimeter), counted with multiplicity. A334697

a(n) = floor( n^π ). A61294

Number of binary sequences of length 2n and curling number 1. A211966

Number of partitions of 2·n having four times as many odd parts as even. A393514

Character of extremal vertex operator algebra of rank 41/2. A28546