Properties of the Number 14508

Fourteen Thousand Five Hundred Eight

Basics

Value: 14507 → 14508 → 14509

Parity: even

Prime: No

Previous Prime: 14503

Next Prime: 14519

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 13 × 31

Divisors: 1, 2, 3, 4, 6, 9, 12, 13, 18, 26

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11100010101100

Octal: 34254

Duodecimal: 8490

Hexadecimal: 38ac

Square: 210482064

Square Root: 120.44915939930839

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 having a unique part of least multiplicity. A362610

a(n) = n * σ(A003961(n)), where A003961 shifts the prime factorization of n one step towards larger primes, and σ is the sum of the divisors of n. A341528

Arrays of dumbbells. A2940

Number of partitions of n² into distinct squares. A30273

Triangle T(n,k), read by rows, given by [0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, ...] δ [1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, ...] where δ is the operator defined in A084938. A111146

a(n) = 2ⁿ mod Fibonacci(n). A57862

Related to sums of the n-th roots of unity: sums in a circular wedge (excluding the origin). A107847

Number of partitions of n containing m(2) as a part, where m denotes multiplicity. A240487

Irregular table read by rows: Take a Reuleaux triangle with all diagonals drawn, as in A340639. Then T(n,k) = number of k-sided polygons in that figure for k >= 3. A340614

a(n) = n * σ(A332818(n)). A389081