Properties of the Number 80030

Eighty Thousand Thirty

Basics

Value: 80029 → 80030 → 80031

Parity: even

Prime: No

Previous Prime: 80021

Next Prime: 80039

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 53 × 151

Divisors: 1, 2, 5, 10, 53, 106, 151, 265, 302, 530

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10011100010011110

Octal: 234236

Duodecimal: 3A392

Hexadecimal: 1389e

Square: 6404800900

Square Root: 282.89574051229545

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

Place a(n) blue and b(n) (A180002) red balls in an urn, draw 5 balls without replacement; Probability(5 red balls) = Probability(3 red and 2 blue balls). A180003

Number of nonnegative integer 3 X 3 matrices with sum of elements equal to n, up to rotational symmetry. A54771

Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(1,1), d=(1,-2) and have k peaks (i.e., ud's). A108767

Number of unlabeled connected graphs with n vertices which are squares. A382180

a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is congruent to 1 mod 3". A80030

Number of unlabeled graphs with n vertices (including disconnected graphs) which are squares. A382181