Properties of the Number 4136

Four Thousand One Hundred Thirty-Six

Basics

Value: 4135 → 4136 → 4137

Parity: even

Prime: No

Previous Prime: 4133

Next Prime: 4139

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ³ × 11 × 47

Divisors: 1, 2, 4, 8, 11, 22, 44, 47, 88, 94

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1000000101000

Octal: 10050

Duodecimal: 2488

Hexadecimal: 1028

Square: 17106496

Square Root: 64.31174076325411

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 in which the sequence of frequencies of the summands is nondecreasing. A100883

Moebius transform of A064987, n*σ(n). A69097

a(n) = 2·n*(n+3). A139570

T(n,k) = Number of length n+5 0..k arrays with every six consecutive terms having two times the sum of some two elements equal to the sum of the remaining four. A249085

Numbers k > 1 such that, in base 3, k and k² contain the same digits in the same proportion. A61657

Sum of the smallest parts of the partitions of n into 9 squarefree parts. A326524

-4-Knödel numbers. A225508

Final term of n-th group in A075383. A75385

Numbers which are representable as a sum of eleven but no fewer consecutive nonnegative integers. A270299

Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3·x, p(n,x) = u·p(n-1,x) + v·p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - x². A368150