Properties of the Number 39157

Thirty-Nine Thousand One Hundred Fifty-Seven

Basics

Value: 39156 → 39157 → 39158

Parity: odd

Prime: Yes

Previous Prime: 39139

Next Prime: 39161

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 39157

Divisors: 1, 39157

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1001100011110101

Octal: 114365

Duodecimal: 1A7B1

Hexadecimal: 98f5

Square: 1533270649

Square Root: 197.88127753782064

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) = 4·a(n-1) + 13·a(n-2) for n>2, a(1)=1, a(2)=4. A200069

Primes of the form (n²+1)/26. A208292

Primes with at least one of each odd digit and no even digits. A108418

Emirps p such that 2·p - reverse(p) is also an emirp. A358689

Integer part of (Product(n^{(1 + log(1 + i})/i²), {i, 1, n})). A62486

Nearest integer to (Product(n^{(1 + log(1 + i})/i²), {i, 1, n})). A62487

Primes of the form n followed by the least k == 1 (mod n). A90920

Primes p with each odd decimal digit present at least once. A232447

a(n) = a(n-2) + a(n-1) if that sum is prime. Otherwise, a(n) = a(n-2) + a(n-1) + prime(m-1) + prime(m-2) + ... + prime(s), where a(-1) = a(0) = prime(0) = 1, m = π(a(n-2)), and s = max(0, 1, 2, ..., m-1) such that the sum is prime. A337347

Lesser p of a sexy prime pair such that (p-3)/2 is also the lesser prime of a sexy prime pair. A358571