Properties of the Number 30126

Thirty Thousand One Hundred Twenty-Six

Basics

Value: 30125 → 30126 → 30127

Parity: even

Prime: No

Previous Prime: 30119

Next Prime: 30133

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5021

Divisors: 1, 2, 3, 6, 5021, 10042, 15063, 30126

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111010110101110

Octal: 72656

Duodecimal: 15526

Hexadecimal: 75ae

Square: 907575876

Square Root: 173.5684303092011

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 non-isomorphic set-systems of weight n with at least one singleton. A330053

Numbers k such that A322582(k) <= A276086(k) <= A348507(k). A392602

The middle coefficient in the minimal polynomial for (2·cos(π/15))ⁿ. A306611

a(n) is the least k such that A345468(k) = 2·n-1. A345469

Array of coefficients of the minimal polynomial of (2·cos(π/15))ⁿ, for n >= 1 (ascending powers). A307886

Schur's numbers (version 1). A30126

Array read by descending antidiagonals: T(n,m) is the number of sequences of length n >= 0 with elements in 0..m-1 such that no iterated difference has a common factor with m >= 1. A353433

Array read by descending antidiagonals: T(n,m) is the number of sequences of length n >= 0 with elements in 1..m-1 such that no iterated difference is divisible by m >= 1. A353434