Properties of the Number 83790

Eighty-Three Thousand Seven Hundred Ninety

Basics

Value: 83789 → 83790 → 83791

Parity: even

Prime: No

Previous Prime: 83777

Next Prime: 83791

Digit Sum: 27

Digital Root: 9

Palindrome: No

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

Divisors: 1, 2, 3, 5, 6, 7, 9, 10, 14, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 10100011101001110

Octal: 243516

Duodecimal: 405A6

Hexadecimal: 1474e

Square: 7020764100

Square Root: 289.46502379389466

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 labeled rooted unordered binary trees (each node has out-degree <= 2). A36774

Consider the arithmetic derivative of a number x. Take the sum of its digits. Repeat the process deleting the first addendum and adding the previous sum. The sequence lists the numbers that after some iterations reach x. A269311

Square array whose entry A(n,k) is the number of labeled rooted trees on a set of size n where each node has at most k neighbors that are further away from the root than the node itself, for n >= 0, k >= 0, read by descending antidiagonals. A325201

Triangle read by rows: T(n,k) = binomial(n+1,k+1) * binomial(4·n-3·k+1,k) / (n+1), 0<=k<=n. A391047

a(n) = 21·a(n-2) + 7·a(n-3), with a(0)=a(1)=0, a(2)=9. A215484

a(1) = 1. a(n) = a(n-1) + a(m), where m is the largest term of the sequence {a(k)} which is less than n. A133488

Scaled coefficients of the M. O. Rubinstein polynomials. A153359

Triangle read by rows: T(m,n) = number of ways of distributing n distinguishable balls into m distinguishable bins of size 2 where empty bins are permitted (m >= 1, 1 <= n <= 2m). A248844

a(n) = ∑_k=1..n ∑_z=1..n ∑_y=1..n ∑_x=1..n [GCD(f(x,y,z), n) = k] * f(x,y,z) * A023900(k), where f(x,y,z) = x² + y² - z². A373582

Smallest start of n consecutive numbers with distinct prime signatures. A83790