Properties of the Number 2535

Two Thousand Five Hundred Thirty-Five

Basics

Value: 2534 → 2535 → 2536

Parity: odd

Prime: No

Previous Prime: 2531

Next Prime: 2539

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 13 ²

Divisors: 1, 3, 5, 13, 15, 39, 65, 169, 195, 507

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 100111100111

Octal: 4747

Duodecimal: 1573

Hexadecimal: 9e7

Square: 6426225

Square Root: 50.34878350069642

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 5 positive 5th powers. A3350

Partial sums of A299272. A299273

Numbers whose base-2 representation is the juxtaposition of two identical strings. A20330

Numbers whose binary expansion is properly periodic. A121016

Generalized 26-gonal (or icosihexagonal) numbers: m*(12·m - 11) with m = 0, +1, -1, +2, -2, +3, -3, ... A316724

Generalized 30-gonal (or triacontagonal) numbers: m*(14·m - 13) with m = 0, +1, -1, +2, -2, +3, -3, ... A316729

Triangle T(n,k), 0 <= k <= n, read by rows defined by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = 4·T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + 5·T(n-1,k) + T(n-1,k+1) for k >= 1. A126331

Numbers whose binary expansion generates rotationally symmetric XOR-triangles. A334556

Numbers m that are the hypotenuse of exactly 7 distinct integer-sided right triangles, i.e., m² can be written as a sum of two squares in 7 ways. A97101

Number A(n,k) of n-length words w over a k-ary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z; square array A(n,k), n>=0, k>=0, read by antidiagonals. A213276