Properties of the Number 10585

Ten Thousand Five Hundred Eighty-Five

Basics

Value: 10584 → 10585 → 10586

Parity: odd

Prime: No

Previous Prime: 10567

Next Prime: 10589

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 × 29 × 73

Divisors: 1, 5, 29, 73, 145, 365, 2117, 10585

Polygonal

Triangular: Yes

Square: No

Pentagonal: No

Hexagonal: Yes

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10100101011001

Octal: 24531

Duodecimal: 6161

Hexadecimal: 2959

Square: 112042225

Square Root: 102.88342918079665

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

Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers. A1567

Carmichael numbers: composite numbers k such that a^k-1 == 1 (mod k) for every a coprime to k. A2997

3-Carmichael numbers: Carmichael numbers equal to the product of 3 primes: k = p·q*r, where p < q < r are primes such that a^k-1 == 1 (mod k) if a is prime to k. A87788

Pseudoprimes to base 3. A5935

Numbers n such that the Reverse and Add! trajectory of n (presumably) does not reach a palindrome and does not join the trajectory of any term m < n. A63048

Euler pseudoprimes: composite numbers n such that 2^(n-1/2) == +-1 (mod n). A6970

Numbers whose multiset multisystem (A302242) is crossing. A324170

a(n) = (2·n+1)*(4·n+1). A14634

Strong pseudoprimes to base 3. A20229

Euler-Jacobi pseudoprimes: 2^(n-1/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol. A47713