Properties of the Number 11931

Eleven Thousand Nine Hundred Thirty-One

Basics

Value: 11930 → 11931 → 11932

Parity: odd

Prime: No

Previous Prime: 11927

Next Prime: 11933

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 41 × 97

Divisors: 1, 3, 41, 97, 123, 291, 3977, 11931

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10111010011011

Octal: 27233

Duodecimal: 6AA3

Hexadecimal: 2e9b

Square: 142348761

Square Root: 109.2291169972549

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

a(1) = 1; thereafter a(n) is always the smallest integer > a(n-1) not leading to a contradiction, such that the concatenation of any four consecutive digits in the sequence is a prime. A152609

Number of compositions (ordered partitions) of n into at most 6 prime parts. A347743

Write the nonprime positive integers on labels in numerical order, forming an infinite sequence L. Now consider the succession of single digits of A000040 (prime numbers): 2 3 5 7 1 1 1 3 1 7 1 9 2 3 2 9 3 1 3 7 4 1 4 3 4 7 5 3 ... (A033308). This sequence gives an arrangement L that produces the same succession of digits, subject to the constraint that the smallest unused label must be used that does not lead to a contradiction. A97487

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences. A294541

Numbers k such that k⁴*2^k - 1 is a prime. A367102

Numbers n such that 4n + 1, 4n + 2 and 4n + 3 are not squarefree. A258332

Sum T(n,k) of the k-th last entries in all blocks of all set partitions of [n]; triangle T(n,k), n>=1, 1<=k<=n, read by rows. A286897

a(1)=a(2)=1. a(n+1) = a(n) + a(largest prime dividing n). A128215

a(n) = product of total number of 0's and total number of 1's in binary expansions of 0, ..., n. A301896

Number of symmetric types of (4,2n)-hypergraphs under action of complementing group C(4,2). A29941