Properties of the Number 11878

Eleven Thousand Eight Hundred Seventy-Eight

Basics

Value: 11877 → 11878 → 11879

Parity: even

Prime: No

Previous Prime: 11867

Next Prime: 11887

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 5939

Divisors: 1, 2, 5939, 11878

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10111001100110

Octal: 27146

Duodecimal: 6A5A

Hexadecimal: 2e66

Square: 141086884

Square Root: 108.98623766329398

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) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = A023531, t = (Lucas numbers). A24319

Number of nonempty pairwise coprime subsets of {1,...,n}, where a single number is not considered to be pairwise coprime unless it is equal to 1. A320426

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally, vertically, diagonally or antidiagonally. A232677

T(n,k)=Number of nXk 0..1 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..1 order. A222703

Consider the version of the Collatz or 3x+1 problem where x -> x/2 if·is even, x -> (3x+1)/2 if·is odd. Define the stopping time of·to be the number of steps needed to reach 1. Sequence gives the number of integers·with stopping time n. A60322

a(n) = prime(n)²-3. A182200

T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some horizontal, vertical or antidiagonal neighbor, without consecutive moves in the same direction. A221886

Shifts 6 places left under Euler transform with a(0)=0 and a(n)=1 for n<6. A218023

Numbers n such that A003145(n) = floor(α²*n)+1, where α = 1.839... is the positive real zero of x³-x²-x-1. A278352

Numerators of continued fraction convergents to sqrt(475). A41906