Properties of the Number 27368

Twenty-Seven Thousand Three Hundred Sixty-Eight

Basics

Value: 27367 → 27368 → 27369

Parity: even

Prime: No

Previous Prime: 27367

Next Prime: 27397

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 ³ × 11 × 311

Divisors: 1, 2, 4, 8, 11, 22, 44, 88, 311, 622

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110101011101000

Octal: 65350

Duodecimal: 13A08

Hexadecimal: 6ae8

Square: 749007424

Square Root: 165.43276579928173

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·p(n), where p(n) is the number of partitions of n. A299474

T(n,k)=Number of length n+k+2 0..k arrays with every value 0..k appearing at least once in every consecutive k+3 elements, and new values 0..k introduced in order. A242322

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 593", based on the 5-celled von Neumann neighborhood. A283182

a(n) = 1 + ∑_k=0..n-3 binomial(n-2,k) * a(k). A344490

Number of ways to place n nonattacking composite pieces queen + rider[1,3] on an n X n chessboard. A189873

Iccanobirt prime indices (10 of 15): Indices of prime numbers in A102120. A102140

Number of length n+4+2 0..4 arrays with every value 0..4 appearing at least once in every consecutive 4+3 elements, and new values 0..4 introduced in order. A242319

Numbers k such that Bernoulli number B_k has denominator 61410. A295591

Number of partitions satisfying cn(2,5) < cn(0,5) + cn(1,5) + cn(4,5) and cn(3,5) < cn(0,5) + cn(1,5) + cn(4,5). A39873

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (0, 0, 1), (0, 1, 0), (1, 0, -1)}. A149881