Properties of the Number -30464

Thirty Thousand Four Hundred Sixty-Four

Basics

Value: -30465 → -30464 → -30463

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ⁸ × 7 × 17

Divisors: 1, 2, 4, 7, 8, 14, 16, 17, 28, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -111011100000000

Octal: -73400

Duodecimal: -15768

Hexadecimal: -7700

Square: 928055296

Square Root: 174.53939383417142

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

Triangle read by rows: T(n, k) = number of matchings of 2n people with partners (of either sex) such that exactly k couples are left together. A55140

Terms of A177763 which have more than one such representation. A177766

Numbers of the form p⁸*q·r where p, q, and r are distinct primes. A179747

T(n, k) = 2ⁿ * n! * [x^k] [zⁿ] (4·exp(x·z))/(exp(z) + 1)², triangle read by rows, for 0 <= k <= n. Coefficients of Euler polynomials of order 2. A326480

Number of permutations of [ n ] with exactly one 132-pattern and two 123-patterns. A46718

Number of squares that divide 1!*2!*3!*...*n!. A248784

3-nonnesting permutations. A193938

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 485", based on the 5-celled von Neumann neighborhood. A282553

a(n) = 27225·n² - 51302·n + 24168. A157802

Number of permutations of [1..n] which achieve the worse case bound for a graph domination problem. A272640