Properties of the Number -20103

Twenty Thousand One Hundred Three

Basics

Value: -20104 → -20103 → -20102

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 6

Digital Root: 6

Palindrome: No

Factorization: 3 × 6701

Divisors: 1, 3, 6701, 20103

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100111010000111

Octal: -47207

Duodecimal: -B773

Hexadecimal: -4e87

Square: 404130609

Square Root: 141.78504857706258

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

Wiener index of a benzenoid consisting of a zig-zag chain of n hexagons (s=13; see the Gutman et al. reference). A193393

Base 2i representation of nonnegative integers. A212494

Number of nonincreasing even cycles in all permutations of {1,2,...,n}. A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1)<b(2)<b(3)<... . A cycle is said to be even if it has an even number of entries. A184958

a(n) = 38·n² + 1. A158593

Coefficient of·in the reduction by x² -> x+1 of the polynomial p(n,x) defined at Comments. A192968

a(n) = A027082(n, 2n-6). A27093

A vector recursion designed around a factorial row sum : v(n)=if[odd,{1.n,n²,...,(n+1)!/2-Sum[2^m,{m,0,n/2-1}],(n+1)!/2-Sum2^m,{m,0,n/2-1}],...n².n,1}],if[ even{1.n,n²,...,(n+1)!-2Sum[2^m,{m,0,n/2-1}],...n².n,1}]. A152938