Properties of the Number 6190

Six Thousand One Hundred Ninety

Basics

Value: 6189 → 6190 → 6191

Parity: even

Prime: No

Previous Prime: 6173

Next Prime: 6197

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 619

Divisors: 1, 2, 5, 10, 619, 1238, 3095, 6190

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1100000101110

Octal: 14056

Duodecimal: 36BA

Hexadecimal: 182e

Square: 38316100

Square Root: 78.67655305108377

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 compositions of n whose run-lengths are all equal. A329738

a(n) = n*(31·n-1)/2. A22288

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every 2X2 subblock sum nondecreasing horizontally, vertically and antidiagonally ne-to-sw. A253326

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = 1 and a(3) = 2. A50028

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1 and a(2) = a(3) = 2. A50044

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 3, and a(3) = 2. A50060

Array read by antidiagonals: T(n,k) (n>=1, k>=1) = number of ways to select four points from an n X k grid so that they form a convex quadrilateral. A334711

Riordan array (1/(1+x), x(1-x)/(1+x)²). A110511

Number of partitions where the number of 1's and 2's are equal. A174455

Sum of first n primes of form 4k-1. A38347