Properties of the Number 45801

Forty-Five Thousand Eight Hundred One

Basics

Value: 45800 → 45801 → 45802

Parity: odd

Prime: No

Previous Prime: 45779

Next Prime: 45817

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 7 × 727

Divisors: 1, 3, 7, 9, 21, 63, 727, 2181, 5089, 6543

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1011001011101001

Octal: 131351

Duodecimal: 22609

Hexadecimal: b2e9

Square: 2097731601

Square Root: 214.0116819241417

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

T(n,k)=Number of arrangements of n+1 numbers x(i) in -k..k with the sum of x(i)*x(i+1) equal to zero. A188358

Number of distinct lines through the origin in 6-dimensional cube of side length n. A90028

Triangle read by rows: T(n,k) = number of distinct lines through the origin in the n-dimensional cubic lattice of side length k with one corner at the origin. A90030

Number of distinct lines through the origin in the n-dimensional lattice of side length 5. A90021

a(n) = ∑_{1 <= x₁, x₂, x₃, x₄, x₅ <= n} n/gcd(x₁, x₂, x₃, x₄, x₅, n). A371878

Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) = ∑_{1 <= x₁, x₂, ..., x_k <= n} n/gcd(x₁, x₂, ..., x_k, n). A372968

Array read by antidiagonals: T(n,k) = number of lattice paths from (0,0) to (n,k) using steps (1,0), (0,1), (1,1), (-1,1) and whose points lie entirely in the integer rectangle of lattice points {(i, j): 0 <= i <= n, 0 <= j <= k}. A232968

Number of lattice paths from (0,0) to (n,n) using steps (1,0), (0,1), (1,1), (-1,1) and whose points lie entirely in the integer square of lattice points {(i,j): 0 <= i,j <= n}. A339654

Number of arrangements of n+1 numbers x(i) in -5..5 with the sum of x(i)*x(i+1) equal to zero. A188354

Number of arrangements of n+1 numbers x(i) in -n..n with the sum of x(i)*x(i+1) equal to zero. A188349