Properties of the Number 19937

Nineteen Thousand Nine Hundred Thirty-Seven

Basics

Value: 19936 → 19937 → 19938

Parity: odd

Prime: Yes

Previous Prime: 19927

Next Prime: 19949

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 19937

Divisors: 1, 19937

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 100110111100001

Octal: 46741

Duodecimal: B655

Hexadecimal: 4de1

Square: 397483969

Square Root: 141.19844191774922

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

Mersenne exponents: primes p such that 2^p - 1 is prime. Then 2^p - 1 is called a Mersenne prime. A43

Bertrand primes: a(n) is largest prime < 2·a(n-1) for n > 1, with a(1) = 2. A6992

Numbers such that every cyclic permutation is a prime. A68652

Balanced primes of order four. A82079

Primes p such that p, p+12, p+24 are consecutive primes. A52188

Circular primes that are not repunits. A293663

Primes p whose period of reciprocal equals (p-1)/7. A56212

Degrees of primitive irreducible trinomials: n such that 2ⁿ - 1 is a Mersenne prime and xⁿ + x^k + 1 is a primitive irreducible polynomial over GF(2) for some k with 0 < k < n. A1153

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