Properties of the Number 13545

Thirteen Thousand Five Hundred Forty-Five

Basics

Value: 13544 → 13545 → 13546

Parity: odd

Prime: No

Previous Prime: 13537

Next Prime: 13553

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 7 × 43

Divisors: 1, 3, 5, 7, 9, 15, 21, 35, 43, 45

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010011101001

Octal: 32351

Duodecimal: 7A09

Hexadecimal: 34e9

Square: 183467025

Square Root: 116.38298844762494

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

Odd abundant numbers (odd numbers m whose sum of divisors exceeds 2m). A5231

Odd primitive abundant numbers. A6038

Numbers k such that k² contains exactly 9 different digits. A54037

a(n) = n*(n² + 3)/2. A229183

Irregular triangle of odd primitive abundant numbers (A006038) in which row n has numbers with n distinct prime factors. A188439

15 times triangular numbers. A194715

Triangle read by rows: T(n,k) is the number of endofunctions on [n] whose third-smallest component has size exactly k; n >= 0, 0 <= k <= max(0,n-2). A350081

a(n) = n·p(n)-spt(n) (= n·A000041(n) - A092269(n)). A220907

Bases b for which there exists an integer y such that y³ in base b looks like [c,d,c,d] for some base-b digits c, d. A290176

Odd recursive abundant numbers: odd numbers k such that A333926(k) > 2·k. A333950