Properties of the Number 53545

Fifty-Three Thousand Five Hundred Forty-Five

Basics

Value: 53544 → 53545 → 53546

Parity: odd

Prime: No

Previous Prime: 53527

Next Prime: 53549

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 × 10709

Divisors: 1, 5, 10709, 53545

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101000100101001

Octal: 150451

Duodecimal: 26BA1

Hexadecimal: d129

Square: 2867067025

Square Root: 231.39792566053828

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 partitions of n where the difference between consecutive parts is at most 7. A238867

a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ... + a(n-3)*a(3) for n >= 4, with initial terms 1, 2, 1, 1. A25243

Number of intersection points when every pair of vertices of a row of n adjacent congruent rectangles are joined by an infinite line. A347750

Triangle read by rows: T(n,k) is the number of bargraphs of semiperimeter n having k levels. A level in a bargraph is a maximal sequence of two or more adjacent horizontal steps; it is preceded and followed by either an up step or a down step. A273344

a(n) = a(n-1) + a(n-2) + 2 a(floor(n/2)) + 3 a(floor(n/3)) + ... + n a(floor(n/n)), where a(0) = 1, a(1) = 2, a(2) = 3. A298370

Number of n-digit numbers with nonzero multiplicative digital root 3. A51814

Natural numbers written out with their digits grouped in sets of 5 (leading zeros omitted). A91341

a(n) = ∑_k=0..2n-2 T(n,k) * T(n,k+2), with T given by A027113. A27142

Triangle read by rows: number of 0-1-2 trees (i.e., ordered trees with vertices of outdegrees 0, 1, or 2) with n edges and exactly k vertices that have 2 children, both being leaves (n >= 0, 0 <= k <= floor((n+2)/4)). A126191

Comparisons needed for Batcher's sorting algorithm applied to 2ⁿ items. A53545