Properties of the Number 27128

Twenty-Seven Thousand One Hundred Twenty-Eight

Basics

Value: 27127 → 27128 → 27129

Parity: even

Prime: No

Previous Prime: 27127

Next Prime: 27143

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ³ × 3391

Divisors: 1, 2, 4, 8, 3391, 6782, 13564, 27128

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100111111000

Octal: 64770

Duodecimal: 13848

Hexadecimal: 69f8

Square: 735928384

Square Root: 164.7057983193063

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

Number of integers with a shortest addition chain of length n. A3065

The number of rectangles (orthogonal or not) with corners on an n X n grid of points. A85582

Number of strict compositions of n whose non-adjacent parts are strictly decreasing. A333150

Integers expressible as x³ + 2·y³ (x, y > 0) in two ways. A219725

Number of partitions into non-integral powers. A160

Denominator coefficients of infinite over the Fibonacci sequence: p(x,n)=(1 - x)*Sum[Fibonacci[k]ⁿ*x^k, {k, 0, Infinity}]; t(n,m)=Coefficients(Numerator(p(x,n)). A156135

G.f. A(x) = ∑_n>=0 a(n)*xⁿ where a(n) = ∑_k=0..n-1 ( ([x^k] A(x)ⁿ) (mod 2ⁿ) ) for n > 0, with a(0) = 1. A376231

a(n) = A027113(n, 2n-10). A27128