Properties of the Number -27114

Twenty-Seven Thousand One Hundred Fourteen

Basics

Value: -27115 → -27114 → -27113

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 4519

Divisors: 1, 2, 3, 6, 4519, 9038, 13557, 27114

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110100111101010

Octal: -64752

Duodecimal: -13836

Hexadecimal: -69ea

Square: 735168996

Square Root: 164.66329281293994

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

Expansion of ∏_k>=1 1/(1 - 2·t^k). A70933

Barely abundant numbers: abundant n such that σ(n)/n < σ(m)/m for all abundant numbers m<n, σ(n) being the sum of the divisors of n. A71927

Number of monocyclic skeletons with n carbon atoms and a ring size of 5. A120333

a(n) = 27·n²/2 + 45·n/2 - 12 (n>=1). A304375

Triangle read by rows: T(n,k) = A(k,n-k), 1 <= k < n, 2 <= n, where A(m,n) is the number of distinct strings consisting of one X, 2·m Y's and 2·n Z's in which the X lies to the right of at least m Y's and at least n Z's. A351584

a(0)=0; a(1)=1; a(n) = ∑_{k=1..[sqrt(n)]} a(n-k) for n>=2. A132915

Multiplicity of highest weight (or singular) vectors associated with character chi₁₂₂ of Monster module. A34510

Partial sums of economical numbers A046759. A172460

a(n) = sum(abs(stirling1(n,k))*stirling2(n+1,k+1)*k!,k=0..n). A192562