Properties of the Number -30782

Thirty Thousand Seven Hundred Eighty-Two

Basics

Value: -30783 → -30782 → -30781

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 15391

Divisors: 1, 2, 15391, 30782

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111100000111110

Octal: -74076

Duodecimal: -15992

Hexadecimal: -783e

Square: 947531524

Square Root: 175.44799799370753

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

Let f(z) = z² + c, then row k lists the expansion of the n-fold composition f(f(...f(0)...)) in rising powers of c. A137560

Number T(n,k) of binary search trees of height k having n internal nodes; triangle T(n,k), k>=0, k<=n<=2^k-1, read by columns. A335920

Number of binary search trees (BST) on n nodes which have the same height as the optimal BST. A328349

Triangle by rows, related to the numbers of binary trees of height less than n, derived from the Mandelbrot set. A202019

Integers i such that 9·i = 25 X i, but 17·i is not 49 X i. A115811

Number of (binary) max-heaps on n elements from the set {0,1} containing exactly eight 0's. A326509

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

Number of (n+1)X(2+1) 0..1 arrays with each row nonprime and column prime, read as a binary number with top and left being the most significant bits. A261937