Properties of the Number 11899

Eleven Thousand Eight Hundred Ninety-Nine

Basics

Value: 11898 → 11899 → 11900

Parity: odd

Prime: No

Previous Prime: 11897

Next Prime: 11903

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 73 × 163

Divisors: 1, 73, 163, 11899

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10111001111011

Octal: 27173

Duodecimal: 6A77

Hexadecimal: 2e7b

Square: 141586201

Square Root: 109.0825375575761

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 partitions of n with more odd parts than even parts. A108950

Sums of six consecutive squares: a(n) = n² + (n+1)² + (n+2)² + (n+3)² + (n+4)² + (n+5)². A27865

Expansion of ∑_n>=0 (qⁿ / ∏_k=1..n+5 (1 - q^k)). A35301

Number of partitions p of n including round(mean(p)) as a part. (This is "Mathematica round"). A241338

a(1) = 932; for n > 1, a(n) = a(n-1) + 1 + sum of distinct prime factors of a(n-1) that are < a(n-1). A105213

Number of free pure achiral multifunctions (with empty expressions allowed) with one atom and n positions. A317882

Bisection of A099924 (Lucas convolution); one half of the terms with odd arguments. A203574

Consider a number x. Take the sum of its digits. Repeat the process deleting the first addendum and adding the previous sum. The sequence lists the numbers that after some iterations reach the sum of the divisors of x. A269308

L.g.f.: ∑_n>=1 x^(2·n-1²) / ( (2·n-1) * (1 - x^2·n)^2·n-1 ). A293598

Numbers k such that 2^k + 2·k + 1 is prime. A301634