Properties of the Number 3585

Three Thousand Five Hundred Eighty-Five

Basics

Value: 3584 → 3585 → 3586

Parity: odd

Prime: No

Previous Prime: 3583

Next Prime: 3593

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 239

Divisors: 1, 3, 5, 15, 239, 717, 1195, 3585

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111000000001

Octal: 7001

Duodecimal: 20A9

Hexadecimal: e01

Square: 12852225

Square Root: 59.87486951969081

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

Positive integers which apparently never result in a palindrome under repeated applications of the function A056964(x) = x + (x with digits reversed). A23108

Numbers that are the sum of 8 positive 9th powers. A3397

Coefficient of xⁿ in ∏_k>=1 (1+x^k)ⁿ. A270913

Diagonal in array of n-gonal numbers A081422. A81437

O.g.f.: ∑_n>=0 1/(1-n·x)ⁿ * xⁿ/n! * exp(-x/(1-n·x)). A218667

Reve's puzzle: number of moves needed to solve the Towers of Hanoi puzzle with 4 pegs and n disks, according to the Frame-Stewart algorithm. A7664

Number of partitions of n having no doubletons. By a doubleton in a partition we mean an occurrence of a part exactly twice (the partition [4,(3,3),2,2,2,(1,1)] of 18 has two doubletons, shown between parentheses). A116645

Triangle read by rows in which row n lists n+1 terms, starting with n, such that the difference between successive terms is equal to n³ - 1. A162614

Number T(n,k) of Dyck paths of semilength n having exactly k (possibly overlapping) occurrences of the consecutive steps UDUUDU (with U=(1,1), D=(1,-1)); triangle T(n,k), n>=0, 0<=k<=max(0,floor(n/2)-1), read by rows. A243366

Number of compositions of n avoiding the pattern (2,1,2). A335473