Properties of the Number 27113

Twenty-Seven Thousand One Hundred Thirteen

Basics

Value: 27112 → 27113 → 27114

Parity: odd

Prime: No

Previous Prime: 27109

Next Prime: 27127

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 19 × 1427

Divisors: 1, 19, 1427, 27113

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100111101001

Octal: 64751

Duodecimal: 13835

Hexadecimal: 69e9

Square: 735114769

Square Root: 164.66025628548013

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

Square roots of highly composite numbers, floored down: a(n) = A000196(A002182(n)). A263096

Antidiagonal sums of table A083362. A83364

G.f.: A(x) = exp(sum(n>=1, A084250(n)*xⁿ/n)), where A084250 lists the least distinct positive integers that allow A(x) to be an integer power series. A84251

a(n) = n³ + prime(n). A89620

Number of length n+3 0..4 arrays with every four consecutive terms having the maximum of some two terms equal to the minimum of the remaining two terms. A249703

Number of length 7+3 0..n arrays with every four consecutive terms having the maximum of some two terms equal to the minimum of the remaining two terms. A249713

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 430", based on the 5-celled von Neumann neighborhood. A272116

Squarefree semiprimes k such that k+1 is the product of three distinct primes and k+2 is the product of four distinct primes. A376352

Triangular array T given by rows: T(n,0)=1 for n >= 0, T(n,1)=1,T(n,2)=2 for n >= 1 and for n >= 2, T(n,k)=T(n-1,k-3)+T(n-1,k-2)+T(n-1,k-1) for 3<=k<=2n-1, T(n,2n)=T(n-1,2n-3)+T(n-1,2n-2). A27113

T(n,k)=Number of length n+3 0..k arrays with every four consecutive terms having the maximum of some two terms equal to the minimum of the remaining two terms. A249707