Properties of the Number -28102

Twenty-Eight Thousand One Hundred Two

Basics

Value: -28103 → -28102 → -28101

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 14051

Divisors: 1, 2, 14051, 28102

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -110110111000110

Octal: -66706

Duodecimal: -1431A

Hexadecimal: -6dc6

Square: 789722404

Square Root: 167.6365115361209

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) = P_n(-1), where P_n(x) is a certain polynomial arising in the enumeration of tatami mat coverings. A226302

Expansion of 1/((1 - 2·x)*sqrt(1 - 4·x)). A82590

a(n) = [xⁿ] (1 + x*(1+x)ⁿ )ⁿ. A121674

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 100 ones. A31868

Triangle read by rows: T(n, k) is the number of singular meanders with n intersections having k tangential intersections. A391919

Fibonacci sequence beginning 4, 26. A22386

Reduced numerators of x²ⁿ in the series expansion of erf(x)² π/4 about 0. A103979

The A161671(n)-th partial sum of A161671. A161778

Semiprimes that are the sum of the first n odd primes for some n. A274182

Triangle T(n,k), read by rows, formed by setting all entries in the zeroth column ((n,0) entries) and the main diagonal ((n,n) entries) to powers of 2 with all other entries formed by the recursion T(n,k) = T(n-1,k) + T(n,k-1). A96466