Properties of the Number 10256

Ten Thousand Two Hundred Fifty-Six

Basics

Value: 10255 → 10256 → 10257

Parity: even

Prime: No

Previous Prime: 10253

Next Prime: 10259

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ⁴ × 641

Divisors: 1, 2, 4, 8, 16, 641, 1282, 2564, 5128, 10256

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10100000010000

Octal: 24020

Duodecimal: 5B28

Hexadecimal: 2810

Square: 105185536

Square Root: 101.27191120937731

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

Numbers that are the sum of 2 positive 4th powers. A3336

Numbers that can be represented as j⁴ + k⁴, with 0 < j < k, in exactly one way. A88687

a(n) = n⁴ * ∑_{p∣n, p prime} 1/p⁴. A351244

T(n, m), numerators of coefficients in a power/Fourier series expansion of the plane pendulum's exact differential time dependence. A274076

Let p and q be two prime numbers, not necessarily consecutive, such that q - p = 2n; a(n) is the number of distinct partitions of 2n into even numbers so that each partition corresponds to a consecutive prime difference pattern (k-tuple) and p<=A000230(n). Multiple occurrences of a partition are not counted. A79024

a(n) = A061086(n) / n. A61087

Numbers that are the sum of two positive fourth powers in exactly one way. A344187

Number of partitions of 5n such that cn(0,5) < cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5). A36888

Number of partitions p of n such that the number of distinct parts is a part and max(p) - min(p) is a part. A241387

Number of set partitions C_t(n) of {1,2,...,t} into at most n parts, with an even number of elements in each part distinguished by marks; triangle C_t(n), t>=0, 0<=n<=t, read by rows. A261275