Properties of the Number 30370

Thirty Thousand Three Hundred Seventy

Basics

Value: 30369 → 30370 → 30371

Parity: even

Prime: No

Previous Prime: 30367

Next Prime: 30389

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 5 × 3037

Divisors: 1, 2, 5, 10, 3037, 6074, 15185, 30370

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111011010100010

Octal: 73242

Duodecimal: 156AA

Hexadecimal: 76a2

Square: 922336900

Square Root: 174.26990560621763

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

T(n,k) = Number of n X k 0..1 arrays with every element both equal and not equal to some elements at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero. A278280

Length of shortest prefix of the Kolakoski sequence K (A000002) containing all blocks of length n that appear in K. A283511

Numbers k such that k² + 1 = p·q, p and q primes and |p-q| is square. A187401

Number of 0..n arrays x(0..10) of 11 elements with zero 6th differences. A200447

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 489", based on the 5-celled von Neumann neighborhood. A272512

Number of n X 3 0..1 arrays with every element both equal and not equal to some elements at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero. A278275

Number of 7Xn 0..1 arrays with every element both equal and not equal to some elements at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero. A278286

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (1, 0, -1), (1, 0, 0), (1, 0, 1)}. A150371

Total sum of the 10th powers of lengths of ascending runs in all permutations of [n]. A229000

Length of n-th run of digit 2 in A030363. A30370