Properties of the Number 3501

Three Thousand Five Hundred One

Basics

Value: 3500 → 3501 → 3502

Parity: odd

Prime: No

Previous Prime: 3499

Next Prime: 3511

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 389

Divisors: 1, 3, 9, 389, 1167, 3501

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110110101101

Octal: 6655

Duodecimal: 2039

Hexadecimal: dad

Square: 12257001

Square Root: 59.16924876994806

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

Coordination sequence for 3D uniform tiling formed by stacking parallel layers of the 3⁴.6 2D tiling (cf. A250120). A299254

Iccanobif numbers: add previous two terms and reverse the sum, starting with 0, 1. A14258

a(n) = ∑_i=1..n C(i+3,4)³. A86024

a(n) = 3·n² + n - 1. A144391

a(n) is the sum of all divisors of the first n odd numbers. A326123

T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every row, column, diagonal or antidiagonal in each 3X3 subblock summing to a prime. A251819

Array read by antidiagonals: T(m,n) is the number of Hamiltonian paths in an m X n grid which start in the top left corner. A378938

Base 7 digits are, in order, the first n terms of the periodic sequence with initial period 1,3. A37579

Row 5 of A277710: Positions of 5's in A264977; positions of 10's in A277330. A277715

Number of partitions of n into at least two parts such that the product of largest and smallest part does not exceed n. A116901