Properties of the Number 27136

Twenty-Seven Thousand One Hundred Thirty-Six

Basics

Value: 27135 → 27136 → 27137

Parity: even

Prime: No

Previous Prime: 27127

Next Prime: 27143

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ⁹ × 53

Divisors: 1, 2, 4, 8, 16, 32, 53, 64, 106, 128

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110101000000000

Octal: 65000

Duodecimal: 13854

Hexadecimal: 6a00

Square: 736362496

Square Root: 164.730082255792

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 right isosceles triangles that can be formed from the n² points of n X n grid of points (or geoboard). A187452

Numbers of the form p⁹*q where p and q are distinct primes. A179692

Structured meta-prism numbers, the n-th number from a structured n-gonal prism number sequence. A100177

Number of permutations of {1,2,...,n} that result in a binary search tree (when elements of the permutation are inserted in that order) of height n-1 (i.e., the second largest possible height). A76616

Hankel transform of A127275. A127276

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 493", based on the 5-celled von Neumann neighborhood. A282659

a(n) = A341886(n)/2; numbers k such that A307437(k) is even. A341887

Number of minimum dominating sets in the 2 X n king graph. A350816

a(n) is the smallest centered triangular number with exactly n prime factors (counted with multiplicity). A358929

a(n) = pos(M(n)), where M(n) is the n X n circulant matrix with (row 1) = (F(0), F(1), ..., F(n-1)), where F = A000045 (Fibonacci numbers), and pos(M(n)) is the positive part of the determinant of M(n); see A380661. A384313