Properties of the Number 27150

Twenty-Seven Thousand One Hundred Fifty

Basics

Value: 27149 → 27150 → 27151

Parity: even

Prime: No

Previous Prime: 27143

Next Prime: 27179

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 5 ² × 181

Divisors: 1, 2, 3, 5, 6, 10, 15, 25, 30, 50

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110101000001110

Octal: 65016

Duodecimal: 13866

Hexadecimal: 6a0e

Square: 737122500

Square Root: 164.7725705328408

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) = floor(C(n,4)/5). A11795

a(n) = Sum_k k·A333274(n,k). A333276

a(n) = T(n,5), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 5 black beads and n-5 white beads. A51170

a(n) = n·Fibonacci(n) * ∑_d∣n 1/(d·Fibonacci(d)). A203319

Number of two-rowed partitions of length 6. A70559

G.f.: ∑_n>=0 (n+1)*(n+2)*(n+3)/3! * xⁿ * (1 + xⁿ)ⁿ. A326004

Expansion of 1 / (1 - ∑_i>=1 ∑_j=1..i x^i·j). A327739

Number of nondecreasing -n..n vectors of length 3 whose dot product with some nondecreasing -n..n vector equals 3. A226411

a(n) = A027144(n, floor(n/2)). A27150