Properties of the Number -11939

Eleven Thousand Nine Hundred Thirty-Nine

Basics

Value: -11940 → -11939 → -11938

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 11939

Divisors: 1, 11939

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10111010100011

Octal: -27243

Duodecimal: -6AAB

Hexadecimal: -2ea3

Square: 142539721

Square Root: 109.26573113286709

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

Numbers such that every cyclic permutation is a prime. A68652

Circular primes that are not repunits. A293663

Square array A(n, k), read by antidiagonals downwards: k-th prime p such that cyclic digit shifts produce exactly n different primes. A317716

The smallest representative in a cycle of circular primes, where circular primes are numbers that remain prime under cyclic shifts of digits. A16114

Geometric mean of the digits = 3. In other words, the product of the digits is = 3^k where k is the number of digits. A61427

Primes p such that p1 = ceiling(p/2) + p is prime and p2 = floor(p1/2) + p1 is prime. A158714

Primes p such that exactly five numbers among all circular permutations of the digits of p are prime. A344629

Primes p such that p's set of distinct digits is {1,3,9}. A108383

Primes of the form 2·n²+26·n+11. A243888

a(n) = smallest prime p for which cyclic digit shifts produce exactly n different primes, or 0 if no such p exists for n. A247153