Properties of the Number 11593

Eleven Thousand Five Hundred Ninety-Three

Basics

Value: 11592 → 11593 → 11594

Parity: odd

Prime: Yes

Previous Prime: 11587

Next Prime: 11597

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 11593

Divisors: 1, 11593

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10110101001001

Octal: 26511

Duodecimal: 6861

Hexadecimal: 2d49

Square: 134397649

Square Root: 107.67079455451233

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 compositions (ordered partitions) of n into squares. A6456

Square array of numbers A(n,k) (n>=0, k>=0) of transitive reflexive early confluent binary relations R on n labeled elements where |{y : xRy}| <= k for all x, read by antidiagonals. A135302

Balanced primes of order nine. A96701

First occurrence of run of primes congruent to 1 mod 4 of exactly length n. A55623

Array read by antidiagonals: The number of parades with n girls and k boys that begin with a girl and end with a boy. A371761

a(n) = 1 + 2·n + 3·n² + 4·n³. A56578

Smallest positive number that can be written as sum of distinct Fibonacci numbers in n ways. A13583

Triangle read by rows: T(n,m) = ∑_i=0..m Stirling2(m+1,i+1)*(-1)^m-i*i^n-m*i!, for n >= 2, m = 1..n-1. A272644

Smallest prime that begins a run of n consecutive primes that are not Ramanujan primes. A174641

Primes p such that p1=Floor[p/2]+p is prime and p2=Floor[p1/2]+p1 is prime. A158711