Properties of the Number 20075

Twenty Thousand Seventy-Five

Basics

Value: 20074 → 20075 → 20076

Parity: odd

Prime: No

Previous Prime: 20071

Next Prime: 20089

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 5 ² × 11 × 73

Divisors: 1, 5, 11, 25, 55, 73, 275, 365, 803, 1825

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100111001101011

Octal: 47153

Duodecimal: B74B

Hexadecimal: 4e6b

Square: 403005625

Square Root: 141.68627315304755

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

Take an n X n square grid of points in the plane; a(n) = number of ways to divide the points into two sets using a straight line. A114043

Number of strongly monotone partitions of [n]. A92920

a(n) = (n³ + 9·n + 14·n + 9)/3. A322595

Molecular topological indices of the gear graphs. A192827

Triangle read by rows: T(n,k) = abs(C(n-k, k)*hypergeom([k-n/2, k-n/2+1/2], [1], -4)). A247488

Number of length n+7 0..1 arrays with at most two downsteps in every n consecutive neighbor pairs. A256822

Number of partitions of n into parts not of the form 19k, 19k+5 or 19k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 8 are greater than 1. A35974

T(n,k) = Number of length n+k 0..1 arrays with at most two downsteps in every k consecutive neighbor pairs. A256816

a(n) = floor( γ(n+5/7)/γ(5/7) ). A20075

Generalized Cullen primes: any primes that can be written in the form n·bⁿ + 1 with n+2 > b > 2. A210339