Properties of the Number -30847

Thirty Thousand Eight Hundred Forty-Seven

Basics

Value: -30848 → -30847 → -30846

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 109 × 283

Divisors: 1, 109, 283, 30847

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -111100001111111

Octal: -74177

Duodecimal: -15A27

Hexadecimal: -787f

Square: 951537409

Square Root: 175.63314038073793

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

Heptanacci-Lucas numbers. A104621

Number of integer partitions of n with at least one pair of consecutive divisible parts. A328221

a(n) = n³ + (n+1)*(n+2). A270109

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 371", based on the 5-celled von Neumann neighborhood. A287904

Numbers that can be represented in more than one way as p²+p·q+q² with p and q primes, p<=q. A349987

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

Numbers·such that x = ∑_i=1..k (x mod d_x+i) for some k, where d_x+i is the aliquot parts of (x+i). A290469

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 43 ones. A31811

a(n) is the maximum number of strong sub-tournaments in an n-tournament. A386875