Properties of the Number 15146

Fifteen Thousand One Hundred Forty-Six

Basics

Value: 15145 → 15146 → 15147

Parity: even

Prime: No

Previous Prime: 15139

Next Prime: 15149

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 7573

Divisors: 1, 2, 7573, 15146

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11101100101010

Octal: 35452

Duodecimal: 8922

Hexadecimal: 3b2a

Square: 229401316

Square Root: 123.0690862889621

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) = prime(n)² - prime(n²). Commutator of (primes, squares) at n. A123914

Weighted count of partitions with distinct parts. A5895

Number of ways to write n as an ordered sum of 5 nonprime numbers. A341482

Let S(1) = {1} and, for n>1 let S(n) be the smallest set containing x, 2x and x+2 for each element·in S(n-1). a(n) is the number of elements in S(n). A122554

Expansion of -(3 - x + 2·x²) / (1 - x³ + x⁴). A110063

Number of unitary polyominoes without holes with n cells. A unitary polyomino is a polyomino whose edges all have length 1. A245660

Numbers n such that partition number p(n) == 14 (mod n). A121015

Least m>0 such that prime(n) divides S(m)=A007908(m)=123...m and all numbers obtained by cyclic permutations of its digits; 0 if no such m exists. A181373

a(n) = ∑_k=0..n φ(k² + 1), where φ is the Euler totient function (A000010). A333170

Numbers k such that the continued fraction for sqrt(k) has period 37. A20376