Properties of the Number 30362

Thirty Thousand Three Hundred Sixty-Two

Basics

Value: 30361 → 30362 → 30363

Parity: even

Prime: No

Previous Prime: 30347

Next Prime: 30367

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 17 × 19 × 47

Divisors: 1, 2, 17, 19, 34, 38, 47, 94, 323, 646

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111011010011010

Octal: 73232

Duodecimal: 156A2

Hexadecimal: 769a

Square: 921851044

Square Root: 174.2469511928401

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 pentagonal regions in regular n-gon with all diagonals drawn. A67152

Number of partitions of 5n such that cn(1,5) = cn(4,5) = cn(2,5) = cn(3,5) < cn(0,5). A202086

T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its west, southwest or northwest neighbor modulo n and the upper left element equal to 0. A267163

Numbers k for which A003973(k) is equal to 2*σ(k). A337384

Numbers m such that product of factorials of digits of m equals σ(m). A137603

a(n) = A331456(n)/4. A331458

a(n) = T(n,n-3), where T is the array in A026386. A26394

Number of length n 1..(4+1) arrays with every leading partial sum divisible by 2, 3, 5 or 7. A258627

Number of nX2 arrays containing 2 copies of 0..n-1 with no element 1 greater than its west, southwest or northwest neighbor modulo n and the upper left element equal to 0. A267162

T(n,k)=Number of length n 1..(k+1) arrays with every leading partial sum divisible by 2, 3, 5 or 7. A258631