Properties of the Number -30722

Thirty Thousand Seven Hundred Twenty-Two

Basics

Value: -30723 → -30722 → -30721

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 15361

Divisors: 1, 2, 15361, 30722

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -111100000000010

Octal: -74002

Duodecimal: -15942

Hexadecimal: -7802

Square: 943841284

Square Root: 175.27692375210148

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 points on surface of dodecahedron: a(n) = 30·n² + 2 for n > 0. A5903

a(n) = n³ - 2·n² + 2. A100109

a(n) is the smallest m for which A188550(m)=n, or a(n)=0 if no such m exists. A188586

Number of (n+1) X 2 0..2 arrays with every 2 X 2 subblock having nonzero determinant and commuting with every horizontal or vertical neighbor. A207142

Number of length n binary words that contain 111 but do not contain 000 (as contiguous subwords). A238361

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...), t = (composite numbers). A24480

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...), t = (composite numbers). A25100

Trajectory of 1 under map n->9n+1 if n odd, n->n/2 if n even. A33962

Trajectory of 3 under map n->9n+1 if n odd, n->n/2 if n even. A37102

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