Properties of the Number 5035

Five Thousand Thirty-Five

Basics

Value: 5034 → 5035 → 5036

Parity: odd

Prime: No

Previous Prime: 5023

Next Prime: 5039

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 5 × 19 × 53

Divisors: 1, 5, 19, 53, 95, 265, 1007, 5035

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001110101011

Octal: 11653

Duodecimal: 2AB7

Hexadecimal: 13ab

Square: 25351225

Square Root: 70.95773389842716

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

Number of subsets {x(1),x(2),...,x(k)} of {1,2,...,n} such that all differences |x(i)-x(j)| are distinct. A143823

a(n) = n*(7·n - 1)/2. A22264

Numbers m such that the factorizations of m..m+3 have the same number of primes (including multiplicities). A45940

a(n) = binomial(n,4) + binomial(n,2). A55795

Numbers obtained by reinterpreting base-2 representation of n in A001563-base (A276326): a(n) = ∑_k>=0 A030308(n,k)*A001563(k+1). A276091

L.g.f.: L(x,y) = log( ∏_n>=1 1/(1 - (xⁿ + yⁿ)) ), where L(x,y) = ∑_n>=0 ∑_k>=0 T(n,k) * xⁿ*y^k / (n+k) such that L(0,0) = 0, as a symmetric square table of coefficients T(n,k) read by antidiagonals starting with T(0,0) = 0. A322200

a(n) = n*(14·n - 1). A195024

Number of cliques in the n-tetrahedral graph. A289837

Number of integer compositions of n whose maximal runs R all satisfy length(R) < first(R). A389512

Smallest number k such that M(n)²-k·M(n)+1 is prime with M(n)= Mersenne primes =A000668(n). A139425