Properties of the Number 14544

Fourteen Thousand Five Hundred Forty-Four

Basics

Value: 14543 → 14544 → 14545

Parity: even

Prime: No

Previous Prime: 14543

Next Prime: 14549

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ² × 101

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 16, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11100011010000

Octal: 34320

Duodecimal: 8500

Hexadecimal: 38d0

Square: 211527936

Square Root: 120.59850745345068

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

Partial sums of A243980. A244050

Least integer m > 0 with π(m·n) = σ(m), where σ(m) is the sum of all positive divisors of m. A247603

Numbers m such that the smallest digit in the decimal expansion of 1/m is 5, ignoring leading and trailing 0's. A352159

Sin(n) decreases monotonically to -1. A46964

Nonpalindromic numbers k such that k is not divisible by 10 and k·R(k) is a square, where R(k) is the reversal of k (A004086). A62917

Triangle read by rows: T(n,g) = number of general immersions of a circle with n crossings in a surface of arbitrary genus g (the circle is not oriented, the surface is oriented). A260848

Number of parts that are visible in one of the three views of the shell model of partitions version "Tree" with n shells. A194803

Numbers k such that all the following properties hold: (i) k·reverse(k) is a square; (ii) k ≠ reverse(k); (iii) k and reverse(k) are not both squares; and (iv) k and reverse(k) have the same number of digits. A82994

Triangular matrix T, read by rows, that satisfies: T² + 2·T = SHIFTUP(T), also Tⁿ⁺¹ + 2·Tⁿ = SHIFTUP(Tⁿ - D·T^n-1) for all n, where D is a diagonal matrix with diagonal(D) = diagonal(T) = {1,2,3,...}. A103236

Array read by antidiagonals: T(m,n) = number of connected dominating sets in the m X n king graph. A291873