Properties of the Number 5300

Five Thousand Three Hundred

Basics

Value: 5299 → 5300 → 5301

Parity: even

Prime: No

Previous Prime: 5297

Next Prime: 5303

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 5 ² × 53

Divisors: 1, 2, 4, 5, 10, 20, 25, 50, 53, 100

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1010010110100

Octal: 12264

Duodecimal: 3098

Hexadecimal: 14b4

Square: 28090000

Square Root: 72.80109889280519

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

Monotonic ordering of set S generated by these rules: if·and y are in S then x² + y² is in S, and 1 is in S. A192476

Number of integer partitions of n with more adjacent equal parts than distinct parts. A360254

T(n,k)=Number of length n+5 0..k arrays with no six consecutive terms having the maximum of any two terms equal to the minimum of the remaining four terms. A249960

T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zero sum, adjacent elements differing by more than one, and elements alternately increasing and decreasing. A200192

T(n,k)=Number of triangular nXnXn 0..k arrays with all rows and diagonals having the same length having the same sum, with corners zero. A195805

The records for distance squared for step lengths between adjacent primes in A330979, the visited primes for a walk stepping to the closest unvisited prime on the Ulam Spiral. A331027

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 1 3 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 1 3 6 or 7. A252192

Lower left-hand y-coordinate for 3 X 3 invisible forest with 0 < x < y. A325605

Number of integer partitions of n whose run-lengths are either strictly increasing or strictly decreasing. A333190

a(n) = n³ + (n+1)³ + (n+2)³ + (n+3)³ + (n+4)³. A27604