Properties of the Number 15130

Fifteen Thousand One Hundred Thirty

Basics

Value: 15129 → 15130 → 15131

Parity: even

Prime: No

Previous Prime: 15121

Next Prime: 15131

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 × 5 × 17 × 89

Divisors: 1, 2, 5, 10, 17, 34, 85, 89, 170, 178

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11101100011010

Octal: 35432

Duodecimal: 890A

Hexadecimal: 3b1a

Square: 228916900

Square Root: 123.00406497347964

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

Generalized Fibonacci numbers: a(n) = a(n-1) + 9·a(n-2). A15445

Numbers such that the two adjacent integers are a perfect square and a prime. A163492

Numbers of the form m² + 1 that can be expressed in more than one way as j² + k² with j > k > 1. A299708

Main diagonal of generalized Fibonacci array A083856. A83859

Total number of palindromic primes in base 8 below 8ⁿ. A117785

a(n) = 9·n² + 1. A247792

Number of integer partitions of n whose distinct parts are the binary indices of some prime number. A372887

Triangle read by rows, e.g.f. exp(x*(z+1/2))/((exp(3·x/2) + 2·cos(sqrt(3)*x/2))/3). A215060

Numbers of the form m² + 1 that can be expressed in more than one way as j² + k² with j > k > 1 and gcd(j,k) = 1. A300166

Expansion of f(t) = F^[-1](t)/t, where F(x) = x/(1 - x² - x³). A319201