Properties of the Number 18933

Eighteen Thousand Nine Hundred Thirty-Three

Basics

Value: 18932 → 18933 → 18934

Parity: odd

Prime: No

Previous Prime: 18919

Next Prime: 18947

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 6311

Divisors: 1, 3, 6311, 18933

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100100111110101

Octal: 44765

Duodecimal: AB59

Hexadecimal: 49f5

Square: 358458489

Square Root: 137.59723834437958

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 intersections inside an equilateral triangular figure formed by the straight line segments mutually connecting all vertices and all points that divide the sides into n equal parts. If three or more lines meet at an interior point this intersection is counted only once. A92866

Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 24. A51965

T(n,k) = Number of (n+1) X (k+1) 0..2 arrays with each row nonprime and column prime, read as a base 3 number with top and left being the most significant digits. A262109

Expansion of exp( ∑_n>=1 sigma₃(2·n)*xⁿ/n ) in powers of x. A282327

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

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

Number of walks within N² (the first quadrant of Z²) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (-1, 0), (-1, 1), (0, -1), (1, 0)}. A151504

Number of (n+1)X(2+1) 0..2 arrays with each row nonprime and column prime, read as a base 3 number with top and left being the most significant digits. A262107

Number of (4+1)X(n+1) 0..2 arrays with each row nonprime and column prime, read as a base 3 number with top and left being the most significant digits. A262113

From the game of Mousetrap. A18933