Properties of the Number 15117

Fifteen Thousand One Hundred Seventeen

Basics

Value: 15116 → 15117 → 15118

Parity: odd

Prime: No

Previous Prime: 15107

Next Prime: 15121

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 5039

Divisors: 1, 3, 5039, 15117

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11101100001101

Octal: 35415

Duodecimal: 88B9

Hexadecimal: 3b0d

Square: 228523689

Square Root: 122.95120983544652

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 ways to write n as an ordered sum of 6 primes. A340962

Auxiliary c(n) sequence used to prove some properties about Rowland's sequence. c(n) has the following recursive definition: c(1) = 5, c_n+1 = c(n) + lfp(c(n)) - 1, where lpf(.) denotes the lowest prime factor of a number. A190894

Semiprimes for which both the sum and the product of the digits is also a semiprime. A118690

Number of partitions of n containing a prime number of distinct primes and an arbitrary number of nonprimes. A344715

Integers m such that σ(m) + σ(m+1) + σ(m+2) - σ(m+3) <= 0, where σ is the sum of divisors. A348698

a(n) is the number of divisors of n! with exactly n divisors. A393242

Numbers k for which 8·k+1, 8·k+5, 8·k+7 and 8·k+11 are primes. A123983

First of three consecutive Sophie Germain semiprimes: n, n+1 and n+2 are all terms of A111153. A283527

Number of partitions of prime(n) containing a prime number of distinct primes and an arbitrary number of nonprimes. A344890

Semiprimes k such that k+1, k+2, 2·k+1 and 2·k+3 are also semiprimes. A362200