Properties of the Number 30931

Thirty Thousand Nine Hundred Thirty-One

Basics

Value: 30930 → 30931 → 30932

Parity: odd

Prime: Yes

Previous Prime: 30911

Next Prime: 30937

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 30931

Divisors: 1, 30931

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111100011010011

Octal: 74323

Duodecimal: 15A97

Hexadecimal: 78d3

Square: 956726761

Square Root: 175.8721126273293

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

The successive approximations up to 2ⁿ for the 2-adic integer 3^1/5. A325892

Sixth term of weak prime sextet: p(m-4)-p(m-5) < p(m-3)-p(m-4) < p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1). A54833

First of three consecutive primes p,q,r such that r²-p²+p, r²-p²+q and r²-p²+r are consecutive primes. A347531

Sum of (Gaussian) q-binomial coefficients for q=-14. A15180

a(0)=113, then a(n) = smallest prime p not already used such that the first three digits of p = the last three digits of a(n-1). A175687

Number of 4-step S, E, and NW-moving king's tours on an n X n board summed over all starting positions. A187509

Number of ways to place zero or more nonadjacent 0,0 1,0 1,1 2,0 2,2 3,0 3,1 3,2 polyhexes in any orientation on a planar nXnXn triangular grid. A155360

a(0)=2, a(1)=3, a(2)=5, a(n) = smallest prime greater than or equal to a(n-1) + a(n-2) + a(n-3). A155954

[ exp(3/13)*n! ]. A30931