Properties of the Number 4191

Four Thousand One Hundred Ninety-One

Basics

Value: 4190 → 4191 → 4192

Parity: odd

Prime: No

Previous Prime: 4177

Next Prime: 4201

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 11 × 127

Divisors: 1, 3, 11, 33, 127, 381, 1397, 4191

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000001011111

Octal: 10137

Duodecimal: 2513

Hexadecimal: 105f

Square: 17564481

Square Root: 64.73793323855806

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 T(n,k) of Dyck paths of semilength n having exactly k (possibly overlapping) occurrences of the consecutive step pattern given by the binary expansion of n, where 1=U=(1,1) and 0=D=(1,-1); triangle T(n,k), n>=0, read by rows. A243752

Ruth-Aaron numbers (2): sum of prime divisors of n = sum of prime divisors of n+1 (both taken with multiplicity). A39752

Positions of occurrences of the natural numbers as third subsequence in A100035. A100038

Number of integer partitions of n such that (maximum) <= 2*(median). A361848

Number of integer partitions of n with all distinct lengths of maximal anti-runs (decreasing by more than 1). A384885

Expansion of (1 - x - x² - sqrt(1 - 2·x - 5·x² - 2·x³ + x⁴)) / (2·x + 2·x²). A78481

Numbers k such that p(k)# + p(k+1)# + 1 is prime, where p(k)# is the product of first k primes (A002110). A128421

Odd numbers k for which A348942(A064989(k)) = 1. A348943

Triangle read by rows: T(n,k) is number of Dyck paths of semilength n and having k UDUD's (here U=(1,1), D=(1,-1)). A94507

Maximal number of squares of side 1 in a disk of radius n. A125228