Properties of the Number 2509

Two Thousand Five Hundred Nine

Basics

Value: 2508 → 2509 → 2510

Parity: odd

Prime: No

Previous Prime: 2503

Next Prime: 2521

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 13 × 193

Divisors: 1, 13, 193, 2509

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100111001101

Octal: 4715

Duodecimal: 1551

Hexadecimal: 9cd

Square: 6295081

Square Root: 50.08991914547278

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: Yes

Fermat Number: No

Cullen Number: No

OEIS Sequences

Numbers that are the sum of 10 positive 6th powers. A3366

A B₂ sequence: a(n) is the least value such that sequence increases and pairwise sums of elements are all distinct. A25582

Numbers n such that the decimal expansions of both n and n² have 0 as smallest digit and 9 as largest digit. A256709

a(n) = (2·n-1)*(n² -n +6)/6. A49480

Number T(n,k) of linear chord diagrams having n chords and minimal chord length k (or k=0 if n=0); triangle T(n,k), n>=0, 0<=k<=n, read by rows. A293881

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every 2X2 subblock ne-sw antidiagonal difference nondecreasing horizontally and nw+se diagonal sum nondecreasing vertically. A258554

Friedman numbers: can be written in a nontrivial way using their digits and the operations + - * / ^ and concatenation of digits (but not of results). A36057

Numbers whose smallest prime factor is 13. A84970

a(1)=1, a(2)=2, for n > 2 if a(n-1) is prime, then a(n) = 2·a(n-1), otherwise a(n) = a(n-1) - 1. A116533

T(n,k)=Number of zero-sum -k..k arrays of n elements with first and second differences also in -k..k. A201873