Properties of the Number 11855

Eleven Thousand Eight Hundred Fifty-Five

Basics

Value: 11854 → 11855 → 11856

Parity: odd

Prime: No

Previous Prime: 11839

Next Prime: 11863

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 5 × 2371

Divisors: 1, 5, 2371, 11855

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10111001001111

Octal: 27117

Duodecimal: 6A3B

Hexadecimal: 2e4f

Square: 140541025

Square Root: 108.8806686239573

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) is the smallest number which can be represented as the sum of n distinct nonzero squares in exactly n ways, or 0 if no such number exists. A350241

Numbers k such that k¹⁰ == 1 (mod 11⁴). A56094

Numbers n for which the digital sum contains the same distinct digits as the digital product but the digital sum is not equal to the digital product. A249335

Cube root of A030683. A30684

The index of prime(n) in A337182. A338222

Number of (n+1) X (n+1) -2..2 symmetric matrices with every 2 X 2 subblock having sum zero and one, two or three distinct values. A211116

a(n) is defined by ∏_i>=1 (1-a(i)*xⁱ) = ∑_i>=0 möbius(i+1)*xⁱ. A266949

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 398", based on the 5-celled von Neumann neighborhood. A271695

Revert transform of 2·x*(1-x)*(1+x²-x⁵) -x/(1+x). A49187

a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == n (mod 3) so far). A60730