Properties of the Number 30311

Thirty Thousand Three Hundred Eleven

Basics

Value: 30310 → 30311 → 30312

Parity: odd

Prime: No

Previous Prime: 30307

Next Prime: 30313

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 17 × 1783

Divisors: 1, 17, 1783, 30311

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111011001100111

Octal: 73147

Duodecimal: 1565B

Hexadecimal: 7667

Square: 918756721

Square Root: 174.10054566255673

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

Maximum value of the cyclic convolution of first n primes with themselves. A299111

dot_product(n,n-1,...2,1)*(7,8,...,n,1,2,3,4,5,6). A26066

a(n) = (1/1 + 1/(n-1) + ... + 1/C(n-[ n/2 ],[ n/2 ]))*L, where L = LCM{1, n-1, ..., C(n-[ n/2 ],[ n/2 ])}. A25563

Numbers n such that 30n-13, 30n-11, 30n-1, 30n+1, 30n+11, 30n+13 are all prime. A175683

a(n) is the smallest m such that A144261(m) = n. A358067

a(n) = a(n-2)+a(n-3)+a(n-4)+a(n-5)+a(n-6)+2·a(n-7)+a(n-8). A109540

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), (0, 1, 1), (1, 0, -1)}. A148290

Fifth column (m=4) of triangle A090447. A90449

a(n) = n * (n+1)² * (n+2)³ * (n+3)⁴. A101214

Least k such that the base-2 representation of n begins at s(k), where s=A030308. A30311