Properties of the Number 80120

Eighty Thousand One Hundred Twenty

Basics

Value: 80119 → 80120 → 80121

Parity: even

Prime: No

Previous Prime: 80111

Next Prime: 80141

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 ³ × 5 × 2003

Divisors: 1, 2, 4, 5, 8, 10, 20, 40, 2003, 4006

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10011100011111000

Octal: 234370

Duodecimal: 3A448

Hexadecimal: 138f8

Square: 6419214400

Square Root: 283.0547650190683

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

G.f.: A(x) = x·exp( ∑_n>=1 A(A(xⁿ))/n ). A179322

G.f.: exp( ∑_n>=1 A055457(n) * 5^A055457(n) * xⁿ/n ) where 5^A055457(n) exactly divides 5·n. A195761

Number of labeled 2-trees with n nodes. A36361

Triangle read by rows: T(n,r) = number of maximum r-uniform acyclic hypergraphs of order n and size n-r+1, 1 <= r <= n+1. A135021

Dyck path encodings of Legendre's candelabras formed for primes in A080114. (I.e., symmetric rooted plane trees constructed from their quadratic residue sets.) A80120

G.f.: A(x) = G(G(x)) where G(x) = x·exp( ∑_n>=1 A(xⁿ)/n ). A179323

L.g.f.: G(x) = x·exp( ∑_n>=1 G(G(xⁿ))/n ) where G(x) = x·exp(∑_n>=1 a(n)*xⁿ/n). A179324