Properties of the Number 20072

Twenty Thousand Seventy-Two

Basics

Value: 20071 → 20072 → 20073

Parity: even

Prime: No

Previous Prime: 20071

Next Prime: 20089

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 ³ × 13 × 193

Divisors: 1, 2, 4, 8, 13, 26, 52, 104, 193, 386

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100111001101000

Octal: 47150

Duodecimal: B748

Hexadecimal: 4e68

Square: 402885184

Square Root: 141.6756859873987

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

Fill an array by antidiagonals upwards; in the top left cell enter a(0)=1; thereafter, in the n-th cell, enter the sum of the entries of those earlier cells that can be seen from that cell. A279212

Positions of 3's in A234323. A234804

Number of nonnegative solutions to x² + y² + z² < n². A218711

Consider the base-3 Kaprekar map n->K(n) defined in A164993. Sequence gives least elements of each cycle of length > 1. A165004

Length of cycle mentioned in A165004. A165005

a(n) = floor( γ(n+3/8)/γ(3/8) ). A20072

A triangular sequence of coefficients made from a product sum of the Pascal/binomial and the Chebyshev T Polynomials: t(n,m)=-Sum[Binomial[n + 1, k + 1]*CoefficientList[ChebyshevT[k + 1, x], x][[m]], {k, m, n}]. A142701