Properties of the Number 11943

Eleven Thousand Nine Hundred Forty-Three

Basics

Value: 11942 → 11943 → 11944

Parity: odd

Prime: No

Previous Prime: 11941

Next Prime: 11953

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 1327

Divisors: 1, 3, 9, 1327, 3981, 11943

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10111010100111

Octal: 27247

Duodecimal: 6AB3

Hexadecimal: 2ea7

Square: 142635249

Square Root: 109.28403360052191

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 integer partitions of n that have an even number of parts and cannot be partitioned into distinct pairs of not necessarily distinct parts. A338915

Add/multiply sequence, see example. A93361

Decimal value of the bitmap of active segments in 7-segment display of the number n, variant 1: bits 0-6 refer to segments from top to bottom, left to right. A234691

T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every consecutive three elements in every row, column and nw-se diagonal having exactly two distinct values, and new values 0 upwards introduced in row major order. A252952

Number of integer partitions of n whose weighted sum is not divisible by n. A362560

Numbers n such that φ(φ(n)) + σ(σ(n)) - φ(σ(n)) - σ(φ(n)) = φ(n). A66945

Boustrophedon transform of 1, 2, 2, 2, 2, ... A674

a(n) = floor( n*(n-1)*(n-2)/19 ). A11901

Number of binary strings of length n with no substrings equal to 0001, 0100, or 1011. A164466

Number of 1X4 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2·n² (number of collections of 1 zero-sum 4-vectors with total modulus squared not more than 2·n², ignoring vector and component permutations). A192691