Properties of the Number 2502

Two Thousand Five Hundred Two

Basics

Value: 2501 → 2502 → 2503

Parity: even

Prime: No

Previous Prime: 2477

Next Prime: 2503

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 139

Divisors: 1, 2, 3, 6, 9, 18, 139, 278, 417, 834

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100111000110

Octal: 4706

Duodecimal: 1546

Hexadecimal: 9c6

Square: 6260004

Square Root: 50.0199960015992

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

Number of points on surface of octahedron; also coordination sequence for cubic lattice: a(0) = 1; for n > 0, a(n) = 4n² + 2. A5899

a(n) = n² + 2. A59100

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n)², where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences. A296245

Numbers k such that the k-th partition number A000041(k) is prime. A46063

Numbers n such that BCR(n) = n, where BCR = binary-complement-and-reverse = take one's complement then reverse bit order. A35928

Number of cubefree words of length n on two letters. A28445

Numbers m such that there are precisely 16 groups of order m. A295161

Non-deficient numbers with even σ which are not Zumkeller. A171641

Number of ways to split a strict integer partition of n into consecutive subsequences with weakly decreasing sums. A319794

Triangle read by rows: T(n,m) (n >= m >= 1) = number of chambers (or regions) formed by drawing the line segments connecting any two of the (n+1) X (m+1) lattice points in an n X m lattice polygon. A288187