Properties of the Number 30380

Thirty Thousand Three Hundred Eighty

Basics

Value: 30379 → 30380 → 30381

Parity: even

Prime: No

Previous Prime: 30367

Next Prime: 30389

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 5 × 7 ² × 31

Divisors: 1, 2, 4, 5, 7, 10, 14, 20, 28, 31

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111011010101100

Octal: 73254

Duodecimal: 156B8

Hexadecimal: 76ac

Square: 922944400

Square Root: 174.29859437184226

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

Dimensions of the irreducible representations of the simple Lie algebra of type E8 over the complex numbers, listed in increasing order. A121732

Numbers n such that uphi(n) = uphi(n+1), where uphi(n) is the unitary totient function (A047994). A287055

T(n,k)=5X5X5 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223432

Numbers k such that iphi(k) = iphi(k+1), where iphi(k) is an infinitary analog to the Euler totient function (A091732). A326403

The r-th term of the n-th row of the following array contains the sum of r successively decreasing integers beginning from n. 0 < r <= n. Sequence contains the leading diagonal. A110427

Number of subsets of {1..n} not containing their mean. A327471

Numbers m such that the GCD of the x's that satisfy σ(x) = m is 4. A241649

Number of sequences of length n with elements {-2,-1,+1,+2}, counted up to simultaneous reversal and negation, such that the sum of elements of the whole sequence but of no proper subsequence equals 0 modulo n. For n>=4, the number of Hamiltonian (undirected) cycles on the circulant graph C_n(1,2). A137726

Weight multiplicities for 30380-dimensional irreducible representation of the Lie algebra E₈. A341290

a(n) = sigma₃(n) - sigma₂(n) - sigma₁(n). A92350