Properties of the Number 20078

Twenty Thousand Seventy-Eight

Basics

Value: 20077 → 20078 → 20079

Parity: even

Prime: No

Previous Prime: 20071

Next Prime: 20089

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 10039

Divisors: 1, 2, 10039, 20078

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100111001101110

Octal: 47156

Duodecimal: B752

Hexadecimal: 4e6e

Square: 403126084

Square Root: 141.69685952765502

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

Number of fully recursively anti-transitive rooted trees with n nodes. A324840

Number of n step self-avoiding walks on 3 X infinity grid starting from (0,0). A302408

Number of ordered triples (w,x,y) with all terms in {1,...,n} and w²<x²+y². A211635

Volume of the Johnson square pyramid (rounded down) with all the edge lengths equal to n. A229063

a(n) = floor(b(n)), where b(1) = 1 and b(n) = b(n-1) + ∑_k=1..n-1 b(k)/(n-1). A376995

Number of 0..n arrays x(0..9) of 10 elements with zero 5th differences. A200446

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 278", based on the 5-celled von Neumann neighborhood. A271097

Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MFI = ZSM-5 Nan[AlnSi96-nO192] starting with a T9 atom. A19168

a(n) = floor( γ(n+2/7)/γ(2/7) ). A20078

Number of nX3 0..3 arrays avoiding the pattern z-2 z-1 z in any row or column. A207285