Properties of the Number 45621

Forty-Five Thousand Six Hundred Twenty-One

Basics

Value: 45620 → 45621 → 45622

Parity: odd

Prime: No

Previous Prime: 45613

Next Prime: 45631

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 37 × 137

Divisors: 1, 3, 9, 37, 111, 137, 333, 411, 1233, 5069

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011001000110101

Octal: 131065

Duodecimal: 22499

Hexadecimal: b235

Square: 2081275641

Square Root: 213.59073013593076

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) is the total number of points (both boundary and interior points) in the n-th figure shown in A255011 (meaning the figure with 4n points on the perimeter), where the interior points are counted with multiplicity. A334698

Nonnegative values·of solutions (x, y) to the Diophantine equation x²+(x+439)² = y². A130645

Partial sums of A127511. A127513

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 1), (0, 0, 1), (0, 1, 0), (1, 1, 0)}. A151055

a(n) is the smallest number which can be represented as the sum of n distinct nonzero n-gonal numbers in exactly 2 ways. A377729

a(n) = 2ⁿ - binomial(n, floor(n/2)). A45621

Table read by antidiagonals: Place k points in general position on each side of a regular n-gon and join every pair of the n*(k+1) boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives number of vertices in the resulting planar graph. A367183