Properties of the Number 6191

Six Thousand One Hundred Ninety-One

Basics

Value: 6190 → 6191 → 6192

Parity: odd

Prime: No

Previous Prime: 6173

Next Prime: 6197

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 41 × 151

Divisors: 1, 41, 151, 6191

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1100000101111

Octal: 14057

Duodecimal: 36BB

Hexadecimal: 182f

Square: 38328481

Square Root: 78.68290792796108

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) = least k >= 1 such that the remainder when 6^k is divided by k is n. A127816

a(n) = a(n-1) + 5·a(n-2), with a(0) = a(1) = 1. A15440

Numbers k such that 2^k + 11 is prime. A102633

Number of cycles of n-digit numbers (including fixed points) under the Kaprekar map A151949. A164731

Let p = n-th prime == 7 mod 8; a(n) = sum of quadratic nonresidues mod p. A282043

Sum of the quadratic nonresidues of prime(n). A125615

Positive integers n such that 2ⁿ == 2¹¹ (mod n). A15935

Odd integers n such that 2ⁿ == 2¹¹ (mod n). A276971

Sum of the smallest parts of all compositions of n into distinct parts. A336902

Number of partitions of n in SPM(n): these are the partitions obtained from (n) by iteration of the following transformation: p -> p' if p' is a partition (i.e., decreasing) and p' is obtained from p by removing a unit from the i-th component of p and adding one to the (i+1)-th component, for any i. A56219