Properties of the Number 16143

Sixteen Thousand One Hundred Forty-Three

Basics

Value: 16142 → 16143 → 16144

Parity: odd

Prime: No

Previous Prime: 16141

Next Prime: 16183

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 5381

Divisors: 1, 3, 5381, 16143

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11111100001111

Octal: 37417

Duodecimal: 9413

Hexadecimal: 3f0f

Square: 260596449

Square Root: 127.0551061547705

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 unlabeled simplicial complexes with n nodes. A261005

a(n) is the number of hierarchical models on n unlabeled factors or variables with linear terms forced. A6602

Number of steps to reach 0 when starting from (2ⁿ)-1 and iterating the map x -> x - (number of runs in binary representation of x): a(n) = A255072(A000225(n)). A255062

Starts of runs of 4 consecutive Gray-code Niven numbers (A344341). A344344

Quotients connected with the Banach matchboxes problem: ∑_{i=1..prime(n)-5} 2^i-1*binomial(i+1,2)/prime(n) (case 2). A238693

Expansion of g.f. A(x) satisfying A(x) = A( x²*(1+x)³ ) / (x*(1+x)²). A369546

The Matula number of the rooted tree obtained from the rooted tree T having Matula number n by replacing each edge of T with a path of length 2. A257538

a(n) = (2ⁿ-1)² + 2·n. A286191

G.f. A(x) satisfies: A(x) = ∏_k>=1 1/(1 - x^k*A(x))^k. A302171

Odd numbers k such that the multiplicative orders of 2 modulo k and modulo k+2 are equal. A333743