Properties of the Number -150050

One Hundred Fifty Thousand Fifty

Basics

Value: -150051 → -150050 → -150049

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 ² × 3001

Divisors: 1, 2, 5, 10, 25, 50, 3001, 6002, 15005, 30010

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -100100101000100010

Octal: -445042

Duodecimal: -72A02

Hexadecimal: -24a22

Square: 22515002500

Square Root: 387.36287896493127

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) = Fibonacci(n)*A113973(n) for n>=1, with a(0)=1, where A113973 lists the coefficients in φ(x³)³/φ(x) and φ() is a Ramanujan θ function. A205969

Number of binary vectors of length n containing no singletons. A6355

Number of base 4 n-digit numbers with adjacent digits differing by one or less. A126358

Layer counting sequence for hyperbolic tessellation by cuspidal triangles of angles (π/3,π/3,0) (this is the classical modular tessellation). A54886

Number of n-digit numbers N that do not end with 0 and are such that the reversal of N divides N but is different from N. A214927

Expansion of g.f. x*(1+x+x²)/(1-x-x²). A128588

a(0) = 1, then twice the Fibonacci sequence. A55389

Row sums of array T in A055818; twice the odd-indexed Fibonacci numbers after initial term. A55819

a(n) = 2·F(n-1) = L(n) - F(n), where F(n) and L(n) are Fibonacci and Lucas numbers respectively. A118658

Expansion of 2·x*(1 - x)/(1 - 3·x + x²). A52995