Properties of the Number 81060

Eighty-One Thousand Sixty

Basics

Value: 81059 → 81060 → 81061

Parity: even

Prime: No

Previous Prime: 81049

Next Prime: 81071

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 5 × 7 × 193

Divisors: 1, 2, 3, 4, 5, 6, 7, 10, 12, 14

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10011110010100100

Octal: 236244

Duodecimal: 3AAB0

Hexadecimal: 13ca4

Square: 6570723600

Square Root: 284.710379157487

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) = n*(n+1)*(11·n+1)/6. A132112

a(n) = ∑_k=1..n binomial(n,k) * sigma₂(k). A356038

Triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges where each maximally connected subgraph is either a tree or a cycle. A144163

Triangle of sums of the first k n-th powers multiplied by binomial(n,k), read by rows. A215078

Numbers n such that φ(n)=d₁!!*d₂!!*...*d_k!! where d₁ d₂ ... d_k is the decimal expansion of n. A139408

Product of differences of distinct prime factors of n. A81060

a(n) is the number of coverings of 1..n by cyclic words of length 3, such that each value from 1 to n appears precisely 3 times. That is, the union of all the letters in all of the words of a given covering is the multiset {1,1,1,2,2,2,...,n,n,n}. Repeats of words are allowed in a given covering. A108242

Triangle read by rows: T(n, m) = binomial(n, m)* ∑_k=0..m binomial(n, k) for 0 <= m <= n. A167024

We use cookies

Some cookies are essential for Natory to function, like keeping you signed in. We also use optional cookies to understand how the app is used and improve it over time. Learn more in our Privacy Policy. You can manage your preferences anytime.