Properties of the Number 18827

Eighteen Thousand Eight Hundred Twenty-Seven

Basics

Value: 18826 → 18827 → 18828

Parity: odd

Prime: No

Previous Prime: 18803

Next Prime: 18839

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 67 × 281

Divisors: 1, 67, 281, 18827

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100100110001011

Octal: 44613

Duodecimal: AA8B

Hexadecimal: 498b

Square: 354455929

Square Root: 137.21151555172037

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

Numbers that are the sum of 4 positive 7th powers. A3371

Triangle read by rows: T(n,k) = number of permutations p of [n] such that max(|p(i)-i|)=k (n>=1, 0<=k<=n-1). A130152

T(n,k)=Number of nXk 0..2 arrays with exactly floor(nXk/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order. A223033

T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north, west or northeast neighbor modulo n and the upper left element equal to 0. A266291

Irregular table read by rows: Take a triangle with Pythagorean triple leg lengths with all diagonals drawn, as in A332978. Then T(n,k) = number of k-sided polygons in that figure for k >= 3 where the legs are divided into unit length parts. A333135

Number of minimal total dominating sets in the n-triangular grid graph. A303228

Number of permutations p of [n] such that max_j=1..n |p(j)-j| = 4. A323800

Numbers in A231626 but not in A343302; first of 5 consecutive deficient numbers in arithmetic progression with common difference > 1. A343303

Sum of squares of digits of n is equal to the largest prime factor of n reversed, where the largest prime factor is not a palindrome. A74303

Number of nX3 0..2 arrays with exactly floor(nX3/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order. A223029