Properties of the Number 4163

Four Thousand One Hundred Sixty-Three

Basics

Value: 4162 → 4163 → 4164

Parity: odd

Prime: No

Previous Prime: 4159

Next Prime: 4177

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 23 × 181

Divisors: 1, 23, 181, 4163

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1000001000011

Octal: 10103

Duodecimal: 24AB

Hexadecimal: 1043

Square: 17330569

Square Root: 64.52131430775415

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 partitions of n into an odd number of parts. A27193

Apply partial sum operator twice to Fibonacci numbers. A1924

Coordination sequence for "ubt" 3D uniform tiling. A299291

One half of number of non-self-conjugate partitions; also half of number of asymmetric Ferrers graphs with n nodes. A701

Number of partitions of 2n of type EO (see Comments). A236559

Numbers that are the sum of 5 positive 6th powers. A3361

a(1) = a(2) = a(3) = a(4) = a(5) = 1 and for n>5: a(n) = a(n-4) + a(n-5). A103372

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 3), t = A023531. A24313

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = floor(n/2), s = (natural numbers >= 3), t = (Fibonacci numbers). A24315

a(n) = n*(8·n - 3). A139273