Properties of the Number -27058

Twenty-Seven Thousand Fifty-Eight

Basics

Value: -27059 → -27058 → -27057

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 83 × 163

Divisors: 1, 2, 83, 163, 166, 326, 13529, 27058

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110100110110010

Octal: -64662

Duodecimal: -137AA

Hexadecimal: -69b2

Square: 732135364

Square Root: 164.49316095205904

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 that have 10 terms in their Zeckendorf representation. A179250

Numbers n such that the digits of σ(n) are exactly the same (albeit in different order) as the digits of φ(n), in base 10. A175795

Let M(n) be the n X n matrix m(i,j)=min(i,j) for 1<=i,j<=n then a(n) is the trace of M(n)^-6. A114358

Record values in A046641. A145771

Number of 0..n-1 integer arrays v[1..5] of length 5 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..4. A171356

Length of the n-th term in the modified Look and Say sequence A110393. A179999

a(n) = prime(n)*prime(n+1) - prime(n). A37166

Number of 0..7 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171313

a(n) = (7·n+2)*(7·n+5) = 49·n² + 49·n + 10. A177060

Number of nX4 0..1 arrays with every element unequal to 0, 1, 3 or 6 king-move adjacent elements, with upper left element zero. A304129