Properties of the Number 20073

Twenty Thousand Seventy-Three

Basics

Value: 20072 → 20073 → 20074

Parity: odd

Prime: No

Previous Prime: 20071

Next Prime: 20089

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 6691

Divisors: 1, 3, 6691, 20073

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100111001101001

Octal: 47151

Duodecimal: B749

Hexadecimal: 4e69

Square: 402925329

Square Root: 141.6792151305194

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^prime(n-1) mod prime(n)². A196202

Number of multisets of exactly six partitions of positive integers into distinct parts with total sum of parts equal to n. A320791

Indices of primes in sequence defined by A(0) = 79, A(n) = 10·A(n-1) - 41 for n > 0. A101142

a(n) is the number of integers that can be represented in a 7-segment display by using only n segments (version A010371). A350438

Length of shortest addition chain for n. A3313

a(n) = floor( γ(n+1/8)/γ(1/8) ). A20073

Length of shortest sequence b with b(0) = 1, b(i+1) = b(i)+d where d∣b(i) and b(k) = n. A117497

G.f. A(x) satisfies: ∑_n>=0 ( 1/A(x) - (1-x)^3·n )ⁿ = 1. A317667

Optimal combination of binary and factor methods for finding an addition chain. A117498