Properties of the Number 19950

Nineteen Thousand Nine Hundred Fifty

Basics

Value: 19949 → 19950 → 19951

Parity: even

Prime: No

Previous Prime: 19949

Next Prime: 19961

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 5 ² × 7 × 19

Divisors: 1, 2, 3, 5, 6, 7, 10, 14, 15, 19

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100110111101110

Octal: 46756

Duodecimal: B666

Hexadecimal: 4dee

Square: 398002500

Square Root: 141.24446891825534

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

Second-order Eulerian triangle T(n,k), 1 <= k <= n. A8517

Coefficient triangle for polynomials used for o.g.f.s for unsigned Stirling1 diagonals. A112007

Triangle of second-order Eulerian numbers T(n,k) (n>=0, 0 <= k <= n) read by rows. A201637

Number of ways of writing n as the sum of 7 triangular numbers. A226252

E2(n, k), the second-order Eulerian numbers with E2(0, k) = δ_{0, k}. Triangle read by rows, E2(n, k) for 0 <= k <= n. A340556

Triangle related to the o.g.f.s. of the right-hand columns of A130534 (E(x,m=1,n)). A163936

Numbers k such that k⁶ + 1091 is prime. A66386

7 times hexagonal numbers: a(n) = 7·n*(2·n-1). A195320

Second-order Eulerian numbers <<n,2>>. A4301

a(n) = ∑_{k=0..floor(2·n/5)} binomial(3·k,2·n-5·k). A392434