Properties of the Number -30247

Thirty Thousand Two Hundred Forty-Seven

Basics

Value: -30248 → -30247 → -30246

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 7 × 29 × 149

Divisors: 1, 7, 29, 149, 203, 1043, 4321, 30247

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111011000100111

Octal: -73047

Duodecimal: -15607

Hexadecimal: -7627

Square: 914881009

Square Root: 173.91664670180367

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

Numbers k such that k and k+1 have the same sum of unitary divisors (A034448). A64125

Starts of runs of 4 consecutive Gray-code Niven numbers (A344341). A344344

Row 4 of table A162430. A162433

Numbers obtained by reinterpreting base-2 representation of odd numbers in primorial base. A328462

Numbers k such that A003415(k) >= A276086(k) and gcd(k, A003415(k)) = gcd(k, A276086(k)), where A003415 is the arithmetic derivative, and A276086 is the primorial base exp-function. A369959

a(n) = 36·n² - n. A157286

T(i, j) = k is the least squarefree number with a run of exactly i>=0 nonsquarefree numbers immediately preceding k and a run of exactly j>=0 nonsquarefree numbers immediately succeeding k. A270996

Numbers that are palindromes in primorial base. A333423

Triangle T(n, k) = binomial(n, k) + binomial(k*(n-k), n) + 2*(-1)ⁿ*StirlingS1(n, k)*StirlingS1(n, n-k), read by rows. A155826

a(n) = 841·n² - 29. A158667