Properties of the Number 5256

Five Thousand Two Hundred Fifty-Six

Basics

Value: 5255 → 5256 → 5257

Parity: even

Prime: No

Previous Prime: 5237

Next Prime: 5261

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ³ × 3 ² × 73

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 18, 24

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1010010001000

Octal: 12210

Duodecimal: 3060

Hexadecimal: 1488

Square: 27625536

Square Root: 72.49827584156743

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) = 2·n*(2·n+1). A2943

Product of a prime and the previous number. A36689

Sums of two distinct prime cubes. A120398

Triangle read by rows: T(n,k) = number of edges in a "frame" of size n X k (see Comments in A331457 for definition). A332600

Largest possible z-value of an integer solution (x,y,z) to 4/n = 1/x + 1/y + 1/z satisfying 0 < x < y < z. The·and y components are in A075245 and A075246. A75247

Triangular array T read by rows (9-diamondization of Pascal's triangle). Step 1: t(n,k) = sum of 9 entries in diamond-shaped subarray of Pascal's triangle having vertices C(n,k), C(n+4,k+2), C(n+2,k), C(n+2,k+2). Step 2: T(n,k) = t(n,k) - t(0,0) + 1. A26907

a(n) = n³ + (n+1)³ + (n+2)³. A27602

Number of non-knapsack integer partitions of n. A366754

Numbers of the form p³ + q³, p, q primes. A86119

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