Properties of the Number 53145

Fifty-Three Thousand One Hundred Forty-Five

Basics

Value: 53144 → 53145 → 53146

Parity: odd

Prime: No

Previous Prime: 53129

Next Prime: 53147

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 1181

Divisors: 1, 3, 5, 9, 15, 45, 1181, 3543, 5905, 10629

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100111110011001

Octal: 147631

Duodecimal: 26909

Hexadecimal: cf99

Square: 2824391025

Square Root: 230.53199344125753

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

a(n) = ∑_k=1..n k²*φ(k), where φ is the Euler totient function A000010. A319087

Triangle read by rows: semigroups of order n with k idempotents, considered to be equivalent when they are isomorphic or anti-isomorphic (by reversal of the operator). A58123

n written in fractional base 7/5. A24642

Number of 4-voter voting schemes with n linearly ranked choices. A7010

a(n) = n⁵ - n⁴ + n³ - n² + n. A191012

Log of g.f. for rooted trees. A6900

Number of active (ON, black) cells at stage 2ⁿ-1 of the two-dimensional cellular automaton defined by "Rule 633", based on the 5-celled von Neumann neighborhood. A273300

Array read by antidiagonals: T(m,n) is the number of closed walks of length n on the complete graph on m nodes, m >= 1, n >= 0. A109502

When cototient function (A051953) is iterated with initial value A002110(n), a(n) = number of iterations required to reach the stationary value=0. A53145