Properties of the Number 15122

Fifteen Thousand One Hundred Twenty-Two

Basics

Value: 15121 → 15122 → 15123

Parity: even

Prime: No

Previous Prime: 15121

Next Prime: 15131

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 7561

Divisors: 1, 2, 7561, 15122

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 11101100010010

Octal: 35422

Duodecimal: 8902

Hexadecimal: 3b12

Square: 228674884

Square Root: 122.97154142320898

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 compositions (ordered partitions) of n into distinct parts, the least being 4. A339165

Nearest integer to 24*(2ⁿ - 1)/n. A3138

Triangle T(n,k) giving the smallest term in "the infinite trunk of factorial beanstalk" (A219666) whose factorial base representation contains n digits (A084558) and the most significant such digit (A099563) is k. A230428

a(n) = ceiling(24(2ⁿ-1)/n). A3177

Fibonacci numbers written in base 7. A4690

Numbers n such that 3, 5 and 7 do not divide swing(n) = A056040(n). A196749

Number of ways to partition {1,2,...,n} into arithmetic progressions, where in each partition all the progressions have the same common difference and have lengths >= 2. A72255

Simple continued fraction expansion of product {k >= 0} (1 - 2*(N - sqrt(N²-1))^4·k+3)/(1 - 2*(N - sqrt(N²-1))^4·k+1) at N = 4. A221194

a(n) = Fibonacci(n) represented in bijective base-7 numeration. A282238

Triangular array read by rows: row n consists of the numbers k such that A075255(k) = A385964(n). A388132