Properties of the Number 11590

Eleven Thousand Five Hundred Ninety

Basics

Value: 11589 → 11590 → 11591

Parity: even

Prime: No

Previous Prime: 11587

Next Prime: 11593

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 19 × 61

Divisors: 1, 2, 5, 10, 19, 38, 61, 95, 122, 190

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10110101000110

Octal: 26506

Duodecimal: 685A

Hexadecimal: 2d46

Square: 134328100

Square Root: 107.65686229869418

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

a(n) = n*(8·n+1). A139275

Expansion of ∏_k>0 (∑_m>=0 x^k·m²). A300446

12-gonal (or dodecagonal) pyramidal numbers: a(n) = n*(n+1)*(10·n-7)/6. A7587

A Collatz-Fibonacci mixture: a(1) = 1, a(2) = 2, a(n+2) = a(n+1)/2+a(n)/2 if a(n+1) and a(n) have the same parity, a(n+2) = a(n+1)+a(n) otherwise. A69202

Total sum of parts greater than 1 in all the partitions of n except one copy of the smallest part greater than 1 of every partition. A196025

Quasi-Carmichael numbers to base -2: squarefree composites n such that for every prime p that divides n, p+2 divides n+2. A29562

a(n) = smallest k having at least four prime divisors d such that (d + n) | (k + n). A202159

Number of (w,x,y) with all terms in {0,...,n} and w<=x+y and x<=y. A212983

Fibonacci sequence beginning 0, 19. A22353

Even Quasi-Carmichael numbers. A262252