Properties of the Number 20131

Twenty Thousand One Hundred Thirty-One

Basics

Value: 20130 → 20131 → 20132

Parity: odd

Prime: No

Previous Prime: 20129

Next Prime: 20143

Digit Sum: 7

Digital Root: 7

Palindrome: No

Factorization: 41 × 491

Divisors: 1, 41, 491, 20131

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100111010100011

Octal: 47243

Duodecimal: B797

Hexadecimal: 4ea3

Square: 405257161

Square Root: 141.8837552364611

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

a(n) = (2·n - 1)*(7·n² - 7·n + 6)/6. A63490

a(n) = dot_product(1,2,...,n)*(6,7,...,n,1,2,3,4,5). A26046

a(n) = (n³ + 18·n² + 17·n + 6)/6. A143058

Number of tilings of a 20 X n rectangle using 2n decominoes of shape I. A250667

Expansion of (1/(1 - x)) * ∑_k>=1 x^k*(2·k-1) / ∏_j=1..2·k-1 (1 - x^j). A318156

Smallest k > 1 such that kⁿ - 1 is the product of n distinct primes. A359070

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (odd natural numbers). A24590

Numbers whose set of base-11 digits is {1,4}. A32823

Expansion of (1/(1 - x)) * ∑_k>=0 x^k*(2·k+1) / ∏_j=1..2·k (1 - x^j). A318155

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A000201 (lower Wythoff sequence). A24599