Properties of the Number 90081

Ninety Thousand Eighty-One

Basics

Value: 90080 → 90081 → 90082

Parity: odd

Prime: No

Previous Prime: 90073

Next Prime: 90089

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 10009

Divisors: 1, 3, 9, 10009, 30027, 90081

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: 10101111111100001

Octal: 257741

Duodecimal: 44169

Hexadecimal: 15fe1

Square: 8114586561

Square Root: 300.13496963866106

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

Solution of the complementary equation a(n) = 2·a(n-1) - a(n-3) + b(n-2), where a(0) = 1, a(1) = 3, a(2) = 5, b(0) = 2, b(1) = 4, b(2) = 6, and (a(n)) and (b(n)) are increasing complementary sequences. A295617

a(n) = binomial(3·n,n)/(2·n+1) (enumerates ternary trees and also noncrossing trees). A1764

F(2n) = bisection of Fibonacci sequence: a(n) = 3·a(n-1) - a(n-2). A1906

Number of simple graphs on n unlabeled nodes. A88

Schroeder's second problem (generalized parentheses); also called super-Catalan numbers or little Schroeder numbers. A1003

Functional determinants; partitions of partitions; Euler transform applied twice to all 1's sequence. A1970

Number of rooted identity trees with n nodes (rooted trees whose automorphism group is the identity group). A4111

Number of simple connected graphs on n unlabeled nodes. A1349

Number of series-reduced planted trees with n leaves. Also the number of essentially series series-parallel networks with n edges; also the number of essentially parallel series-parallel networks with n edges. A669

Fine's sequence (or Fine numbers): number of relations of valence >= 1 on an n-set; also number of ordered rooted trees with n nodes having root of even degree. A957