Properties of the Number 18927

Eighteen Thousand Nine Hundred Twenty-Seven

Basics

Value: 18926 → 18927 → 18928

Parity: odd

Prime: No

Previous Prime: 18919

Next Prime: 18947

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 701

Divisors: 1, 3, 9, 27, 701, 2103, 6309, 18927

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100100111101111

Octal: 44757

Duodecimal: AB53

Hexadecimal: 49ef

Square: 358231329

Square Root: 137.5754338535772

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(1)=15; for n>1, a(n) = the smallest number k >a(n-1) such that 2·A174214(k)= 3*(k-1). A174216

a(n) = n³ - n² - n. A152015

A symmetrical triangle sequence: T(n, k) = q^k + q^n-k - qⁿ, with q=3. A176225

Minimal order of degree-n irreducible polynomials over GF(19). A218362

a(n) is the smallest multiple of n such that a(n) mod 100 = n and S(n)=n where S(n) is the sum of the base-ten digits of n, or 0 if no such a(n) exists. A75154

a(n) = nonnegative value y such that (A155135(n), y) is a solution to the Diophantine equation x³+28·x² = y². A155137

a(n) = 28·n² - 1. A158554

Number of parts of even multiplicities in all the partitions of n. A264400

Number of binary words of length n containing at least one subword 10¹⁰1 and no subwords 10ⁱ1 with i<10. A143290

a(n) = nonnegative value y such that (A155136(n), y) is a solution to the Diophantine equation x³+28·x² = y². A155138