Properties of the Number 19147

Nineteen Thousand One Hundred Forty-Seven

Basics

Value: 19146 → 19147 → 19148

Parity: odd

Prime: No

Previous Prime: 19141

Next Prime: 19157

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 41 × 467

Divisors: 1, 41, 467, 19147

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101011001011

Octal: 45313

Duodecimal: B0B7

Hexadecimal: 4acb

Square: 366607609

Square Root: 138.3726851658231

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

Least inverse of A015910: smallest integer k > 0 such that 2^k mod k = n, or 0 if no such k exists. A36236

Number of compositions (p₁, p₂, p₃, ...) of n with 1 <= p_i <= i for all i. A8930

Composite and every divisor (except 1) contains the digit 4. A62670

Irregular triangle read by rows where T(n,k) is the number of integer compositions of n with k excedances (parts above the diagonal), all zeros removed. A352524

Numbers k such that 2^k == 5 (mod k). A128121

Least positive number k such that 2^k mod k = 2n+1, or 0 if no such k exists. A124977

a(n) = [xⁿ] (1/(1 - x))*∏_k>=1 1/(1 - x^k)ⁿ. A303070

a(n) = ∑_j=1..n ∑_k=1..n φ(j·k). A372633

Define two triangular arrays by: B(0,0)=C(0,0)=1, B(0,r)=C(0,r)=0 for r>0, C(t,-1)=C(t,0); and for t,r >= 0, B(t+1,r)=C(t,r-1)+2C(t,r)-B(t,r), C(t+1,r)=B(t+1,r)+2B(t+1,r+1)-C(t,r). Sequence gives array B(t,r) read by rows. A177011

Semiprimes p·q with p < q and 2^p (mod q) == 2^q (mod p). A179839