Properties of the Number -15139

Fifteen Thousand One Hundred Thirty-Nine

Basics

Value: -15140 → -15139 → -15138

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 15139

Divisors: 1, 15139

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11101100100011

Octal: -35443

Duodecimal: -8917

Hexadecimal: -3b23

Square: 229189321

Square Root: 123.04064369142418

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

Primes of the form 2·n²+1. A90698

Triangle read by rows: T(n, k) = n! * 2^k * hypergeom([-k], [-n], -1/2). A374427

Primes and their indices such that when their respective SOD's are both prime, the SOD of the index is the nextprime of the prime SOD. A117458

Smallest of 3 consecutive prime numbers such that p1·p2·p3·d1·d2=average of twin prime pairs; p1,p2,p3 consecutive prime numbers; d1(δ)=p2-p1, d2(δ)=p3-p2. A153409

a(n) = 18·n² + 1. A157889

Twin prime pairs that sum to a power. A119768

Primes of the form k² + 10. A138355

Form the difference table of the sequence {2^k*k!}, then divide k-th column entries by 2^k*k!. Array read by ascending antidiagonals, T(n, k) for n, k >= 0. A143410

Primes prime(k) such that 2*(prime(k)² - prime(k-1)²) is a perfect square. A335410

Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k columns of odd length (0<=k<=n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column. A121745