Properties of the Number -58506

Fifty-Eight Thousand Five Hundred Six

Basics

Value: -58507 → -58506 → -58505

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 7 ² × 199

Divisors: 1, 2, 3, 6, 7, 14, 21, 42, 49, 98

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1110010010001010

Octal: -162212

Duodecimal: -29A36

Hexadecimal: -e48a

Square: 3422952036

Square Root: 241.88013560439393

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

T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 1 or 4 king-move neighboring 1s. A296019

Numbers k such that sopf(k) = sopf(k+3), where sopf(k) = A008472(k). A63969

G.f.: A(q) = exp( ∑_n>=1 A162552(n) * 3·A038500(n) * qⁿ/n ). A161808

Number of nX5 0..1 arrays with each 1 adjacent to 1 or 4 king-move neighboring 1s. A296016

Number of nX6 0..1 arrays with each 1 adjacent to 1 or 4 king-move neighboring 1s. A296017

a(n) is the least k such that the sum of the first k numbers with n prime factors, counted with multiplicity, is prime. A376480

Numbers k whose decimal representation can be split in three parts which can be used as seeds for a tribonacci-like sequence containing k itself. A383230

Triangular array T(n,k) = k ∑_j=0..k-1 (-1)^j binomial(k-1,j) (n-1-j)^n-1, 1<=k<=n, read by rows. A281485