Properties of the Number -27555

Twenty-Seven Thousand Five Hundred Fifty-Five

Basics

Value: -27556 → -27555 → -27554

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 11 × 167

Divisors: 1, 3, 5, 11, 15, 33, 55, 165, 167, 501

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110101110100011

Octal: -65643

Duodecimal: -13B43

Hexadecimal: -6ba3

Square: 759278025

Square Root: 165.99698792448012

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

a(n) = (4·n+1)*(4·n+3). A1539

Triangle of number of permutations by length of shortest ascending run. A64315

a(n) = ∑_d∣n φ(d⁴). A68970

a(n) = floor(n!^1/3). A214083

Number of distinct residues of xⁿ (mod n⁵), x=0..n⁵-1. A365102

a(0)=a(1)=1, a(n) = least k > a(n-1) such that k·a(n-2) is an oblong number. A214963

Number of permutations of [n] having a shortest ascending run of length 2. A185652

Smallest odd number k such that p(2m)-2p(m)=k has exactly n solutions (where p(m) = m-th prime). A69890

a(n) = K₃(n) = ∑_k>=0 A090285(3,k)*2^k*binomial(n,k). a(n) = (4·n³+30·n²+56·n+15)/3. A90294

Least multiple of prime(n) containing only prime digits (2,3,5,7). A113590