Properties of the Number -19070

Nineteen Thousand Seventy

Basics

Value: -19071 → -19070 → -19069

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 5 × 1907

Divisors: 1, 2, 5, 10, 1907, 3814, 9535, 19070

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -100101001111110

Octal: -45176

Duodecimal: -B052

Hexadecimal: -4a7e

Square: 363664900

Square Root: 138.09417076763233

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 maximal subsets of {1..n} such that it is possible to choose a different binary index of each element. A370640

Taylor series related to one in Ramanujan's Lost Notebook. A6305

Records in A096335 (values). A221181

Number of partitions n such that the multiplicity of the number of odd parts is a part. A240541

Number of binary strings of length n with equal numbers of 00110 and 10001 substrings. A164255

Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^t+u+v) having two, three, four, six or seven distinct values for every i,j,k<=n. A211740

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

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