Properties of the Number 80750

Eighty Thousand Seven Hundred Fifty

Basics

Value: 80749 → 80750 → 80751

Parity: even

Prime: No

Previous Prime: 80749

Next Prime: 80761

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 ³ × 17 × 19

Divisors: 1, 2, 5, 10, 17, 19, 25, 34, 38, 50

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10011101101101110

Octal: 235556

Duodecimal: 3A892

Hexadecimal: 13b6e

Square: 6520562500

Square Root: 284.1654447676564

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) = ∑_d∣n σ(n/d)*d³. A27847

a(n) = 10·a(n-1) - 5·a(n-2), with a(0)=0, a(1)=1. A190987

Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of g.f. 1/(1 - 2·k*x + k·x²). A342133

a(n) = number of (s(0), s(1), ..., s(2·n-1)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n, s(0) = 3, s(2·n-1) = 4. Also a(n) = T(2·n-1,n-1), where T is defined in A026022. A26026

a(n)=the (1,2)-entry of the n-th power of the 2 X 2 matrix [0,-1;n-1,2*(n-1)]. A109520

Number of -2..2 arrays x(0..n+2) of n+3 elements with zero sum and no two or three adjacent elements summing to zero. A200424

T(n,[ n/2 ]), where T is defined in A026022. A26034

T(n,k)=Number of -k..k arrays x(0..n+2) of n+3 elements with zero sum and no two or three adjacent elements summing to zero. A200430

a(n) = largest number greater than a(n-1) such that the first n terms of the sequence contain a total of a(n) base-10 digits. A80750