Properties of the Number -16338

Sixteen Thousand Three Hundred Thirty-Eight

Basics

Value: -16339 → -16338 → -16337

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 7 × 389

Divisors: 1, 2, 3, 6, 7, 14, 21, 42, 389, 778

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11111111010010

Octal: -37722

Duodecimal: -9556

Hexadecimal: -3fd2

Square: 266930244

Square Root: 127.8201861992072

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

Concatenation of n-th prime and n in decimal notation. A75110

T(n,k)=Number of nXk 0..2 arrays with every 0 next to a 1 and every 1 next to a 2 horizontally or antidiagonally, with no adjacent elements equal. A232335

Number T(n,k) of Dyck paths of semilength n having exactly k (possibly overlapping) occurrences of the consecutive steps UDUUUDDDUD (with U=(1,1), D=(1,-1)); triangle T(n,k), n>=0, 0<=k<=max(0,floor((n-1)/4)), read by rows. A243881

Number of nX2 0..1 arrays with every element equal to 2, 3 or 5 king-move adjacent elements, with upper left element zero. A297870

a(n) = A364557(n) - A000010(n), where A364557 is the Möbius transform of A005941, and A000010 (Euler φ) is the Möbius transform of A000027. A364558

a(n) = A005941(n) - n. A364559

A089450 indexed by A000040. A89525

a(n) is number of solutions of the equation σ(x)=10ⁿ. A110078

a(n) = 961·n + 1. A158414

Number of Dyck paths of semilength n avoiding the consecutive steps UDUUUDDDUD (with U=(1,1), D=(1,-1)). A243870