Live analysis

2,560

2,560 is a composite number, even.

This number doesn't have a permanent NumberWiki page yet — what you see below is computed live. Pages get added to the permanent index when they're notable (years, primes, curated, etc.).

Abundant Number Evil Number Gapful Number Pernicious Number Practical Number Recamán's Sequence Self Number Semiperfect Number

Properties

Parity: Even
Digit count: 4
Digit sum: 13
Digit product: 0
Digital root: 4
Palindrome: No
Bit width: 12 bits
Reversed: 652
Recamán's sequence: a(7,512) = 2,560
Square (n²): 6,553,600
Cube (n³): 16,777,216,000
Divisor count: 20
σ(n) — sum of divisors: 6,138
φ(n) — Euler's totient: 1,024
Sum of prime factors: 23

Primality

Prime factorization: 2 ⁹ × 5

Nearest primes: 2,557 (−3) · 2,579 (+19)

Divisors & multiples

All divisors (20)

1 · 2 · 4 · 5 · 8 · 10 · 16 · 20 · 32 · 40 · 64 · 80 · 128 · 160 · 256 · 320 · 512 · 640 · 1280 (half) · 2560

Aliquot sum (sum of proper divisors): 3,578

Factor pairs (a × b = 2,560)

1 × 2560

2 × 1280

4 × 640

5 × 512

8 × 320

10 × 256

16 × 160

20 × 128

32 × 80

40 × 64

First multiples

2,560 · 5,120 (double) · 7,680 · 10,240 · 12,800 · 15,360 · 17,920 · 20,480 · 23,040 · 25,600

Sums & aliquot sequence

As a sum of two squares: 16² + 48²

As consecutive integers: 510 + 511 + 512 + 513 + 514

Aliquot sequence: 2,560 → 3,578 → 1,792 → 2,296 → 2,744 → 3,256 → 3,584 → 4,600 → 6,560 → 9,316 → 8,072 → 7,078 → 3,542 → 3,370 → 2,714 → 1,606 → 1,058 — unresolved within range

Representations

In words: two thousand five hundred sixty
Ordinal: 2560th
Roman numeral: MMDLX
Binary: 101000000000
Octal: 5000
Hexadecimal: 0xA00
Base64: CgA=
One's complement: 62,975 (16-bit)

In other bases

ternary (3) 10111211

quaternary (4) 220000

quinary (5) 40220

senary (6) 15504

septenary (7) 10315

nonary (9) 3454

undecimal (11) 1a18

duodecimal (12) 1594

tridecimal (13) 121c

tetradecimal (14) d0c

pentadecimal (15) b5a

Historical numeral systems

Babylonian (base 60): 𒌋𒌋𒌋𒌋𒁹𒁹 𒌋𒌋𒌋𒌋
Egyptian hieroglyphic: 𓆼𓆼𓍢𓍢𓍢𓍢𓍢𓎆𓎆𓎆𓎆𓎆𓎆
Greek (Milesian): ͵βφξʹ
Mayan (base 20): 𝋦·𝋨·𝋠
Chinese: 二千五百六十
Chinese (financial): 貳仟伍佰陸拾

In other modern scripts

Eastern Arabic ٢٥٦٠ Devanagari २५६० Bengali ২৫৬০ Tamil ௨௫௬௦ Thai ๒๕๖๐ Tibetan ༢༥༦༠ Khmer ២៥៦០ Lao ໒໕໖໐ Burmese ၂၅၆၀

Digit at this position in famous constants

π — Pi (π): Digit 2,560 = 0
e — Euler's number (e): Digit 2,560 = 6
φ — Golden ratio (φ): Digit 2,560 = 9
√2 — Pythagoras's (√2): Digit 2,560 = 0
ln 2 — Natural log of 2: Digit 2,560 = 2
γ — Euler-Mascheroni (γ): Digit 2,560 = 2

Also seen as

Goldbach decomposition

Goldbach's conjecture says every even integer greater than 2 is the sum of two primes. For 2560, here are decompositions:

3 + 2557 = 2560
11 + 2549 = 2560
17 + 2543 = 2560
29 + 2531 = 2560
83 + 2477 = 2560
101 + 2459 = 2560
113 + 2447 = 2560
137 + 2423 = 2560

Showing the first eight; more decompositions exist.

Hex color

#000A00

RGB(0, 10, 0)

IPv4 address

As an unsigned 32-bit integer, this is the IPv4 address 0.0.10.0.

Address: 0.0.10.0
Class: reserved
IPv4-mapped IPv6: ::ffff:0.0.10.0

Unspecified address (0.0.0.0/8) — "this network" placeholder.

Position in π

The digit sequence 2560 first appears in π at position 4,761 of the decimal expansion (the 4,761ordinal-suffix:st digit after the integer 3).

Search range: the first 1,000,000 fractional digits of π. Any 6-digit-or-shorter string is virtually guaranteed to appear in there — the more interesting signal is the position.

Look up 2560 on Pi Search ↗