Properties of the Number 39293

Thirty-Nine Thousand Two Hundred Ninety-Three

Basics

Value: 39292 → 39293 → 39294

Parity: odd

Prime: Yes

Previous Prime: 39251

Next Prime: 39301

Digit Sum: 26

Digital Root: 8

Palindrome: Yes

Factorization: 39293

Divisors: 1, 39293

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001100101111101

Octal: 114575

Duodecimal: 1A8A5

Hexadecimal: 997d

Square: 1543939849

Square Root: 198.22462006521792

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(n) = smallest palindromic prime that begins with A082768(n), or 0 if no such number exists. A82769

Prime p1 of consecutive primes p1, p2, where p2 - p1 = 8, and p1, p2 are in different centuries. A287049

Palindromic prime units W appearing twice in first-order fractal palindromic primes WmW. A82598

Palindromic primes that yield a prime when sandwiched between two 7's. (Prefixing and suffixing a 'seven' on both sides yields another pal prime). A88271

Primes p of Erdos-Selfridge class 4+ with largest prime factor of p+1 not of class 3+. A129472

Primes that remain prime through 3 iterations of function f(x) = 3x + 4. A23278

Primes of the form 666·k - 1. A63472

First palindromic prime pyramids with a(1)=2 such that (number of digits in a(n+1)) = (number of digits in a(n)) + 2. A70922

Second palindromic prime pyramids with a(1)=2 such that (number of digits in a(n+1)) = (number of digits in a(n)) + 2. A70927

Palindromic primes = 1 mod 4. A81220