Properties of the Number 30016

Thirty Thousand Sixteen

Basics

Value: 30015 → 30016 → 30017

Parity: even

Prime: No

Previous Prime: 30013

Next Prime: 30029

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 ⁶ × 7 × 67

Divisors: 1, 2, 4, 7, 8, 14, 16, 28, 32, 56

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111010101000000

Octal: 72500

Duodecimal: 15454

Hexadecimal: 7540

Square: 900960256

Square Root: 173.2512626216617

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 clouds with n points; number of undirected 2-regular labeled graphs; or number of n X n symmetric matrices with (0,1) entries, trace 0 and all row sums 2. A1205

Triangle T(n,k) (n >= 1, 0 <= k <= n-1) giving number of regular labeled graphs with n nodes and degree k, read by rows. A59441

Number T(n,k) of permutations of {1,2,...,n} that result in a binary search tree of height k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A195581

Number of subsets of {1..n} containing the product of any set of distinct elements whose product is <= n. A326081

Triangle by rows T(n,k), showing the number of meanders with length (n+1)*3 and containing (k+1)*3 L's and (n-k)*3 R's, where L's and R's denote arcs of equal length and a central angle of 120 degrees which are positively or negatively oriented. A194595

Triangle read by rows: T(n,k) is the number of connected k-regular simple graphs on n labeled vertices, (0 <= k < n). A324163

Number of subsets of {2..n} such that it is not possible to choose a different binary index of each element. A370643

Triangle read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges that are node-disjoint unions of undirected cycle subgraphs. A144161

Gaps of 8 in sequence A038593 (lower terms). A38655

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