Properties of the Number 14528

Fourteen Thousand Five Hundred Twenty-Eight

Basics

Value: 14527 → 14528 → 14529

Parity: even

Prime: No

Previous Prime: 14519

Next Prime: 14533

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ⁶ × 227

Divisors: 1, 2, 4, 8, 16, 32, 64, 227, 454, 908

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 11100011000000

Octal: 34300

Duodecimal: 84A8

Hexadecimal: 38c0

Square: 211062784

Square Root: 120.53215338655491

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 integer partitions of n with all distinct run-sums. A353837

Least number which may be expressed as the sum of a prime number and a nonzero square in exactly n different ways. A64283

Triangle read by rows. T(n, k) = kⁿ * BellPolynomial(n, k). A350257

a(n) = 2·6ⁿ-4ⁿ. A81626

Number of partitions of n into Fibonacci number of integer parts. A102848

Triangle read by rows: T(n,k) is the number of 2-compositions of n having k columns with an odd sum (0<=k<=n). A 2-composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n. A181308

Number of compositions of n into distinct parts where each part i is marked with a word of length i over a k-ary alphabet (k=1,2,3,...) whose letters appear in alphabetical order and all k letters occur at least once in the composition. A261838

a(n) is the least positive integer that can be expressed as the sum of a prime number and a square of a nonnegative integer in exactly n ways. A365288

a(n) is the number of cubic polynomials with coefficients in {-n, ..., n}, positive leading coefficient, and having three rational roots. A392944

a(1) = 1, a(n) = n+a(n-1) if n does not divide a(n-1), else a(n) = n·a(n-1). A95234