Properties of the Number 18128

Eighteen Thousand One Hundred Twenty-Eight

Basics

Value: 18127 → 18128 → 18129

Parity: even

Prime: No

Previous Prime: 18127

Next Prime: 18131

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ⁴ × 11 × 103

Divisors: 1, 2, 4, 8, 11, 16, 22, 44, 88, 103

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100011011010000

Octal: 43320

Duodecimal: A5A8

Hexadecimal: 46d0

Square: 328624384

Square Root: 134.6402614376547

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 ways to choose a partition, with odd parts, of each part of a partition of n into odd parts. A300301

Number of ways to choose an odd partition of each part of an odd partition of 2n+1. A279374

Numbers n of the form k + reverse(k) for exactly two k. A72040

Infinite square array, where row r >= 0 is the orbit of r under the map A380873: concatenate(sum of digits, product of digits). A380872

Triangle read by rows: T(n,k) (0 <= k <= n) = numerator of Integral_x=0..n binomial(x,k). A241186

Number of minimal total dominating sets in the n-Pell graph. A379571

Let m(k) be the index of the largest triangular number <= k; then a(n) is the smallest number k that can be written as the sum of three triangular numbers if the largest is the (m(k)-n)-th triangular number, but no larger. A331753

Triangle read by rows. T(n, k) = A355776(n, k) + A355777(n, k). Refining A174159, the Euler minus Narayana/Catalan triangle. A356113

Lower Wythoff sequence (a Beatty sequence): a(n) = floor(n*φ), where φ = (1+sqrt(5))/2 = A001622. A201

Upper Wythoff sequence (a Beatty sequence): a(n) = floor(n*φ²), where φ = (1+sqrt(5))/2. A1950