Properties of the Number -147

One Hundred Forty-Seven

Basics

Value: -148 → -147 → -146

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 ²

Divisors: 1, 3, 7, 21, 49, 147

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: -10010011

Octal: -223

Duodecimal: -103

Hexadecimal: -93

Square: 21609

Square Root: 12.12435565298214

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) = nearest integer to n² * cos(sqrt(n)). A274090

Take alternate terms of A274088 and A274090. A274091

a(n) = nearest integer to k²*sin(sqrt(k)+j*π/2) where n = 3·k+j, 0<=j<3. A274092

Triangle read by rows: T(n, m) = S1(n, m)*7^n-m, where S1 are the signed Stirling numbers of first kind A008275 (n >= 1, 1 <= m <= n). A51186

Expansion of χ(-q) / χ(-q⁷) in powers of q where χ() is a Ramanujan θ function. A113297

Expansion of (1 - 4t)/(1 - x + t x²): a Fibonacci-type sequence of polynomials. A267633

Expansion of (1-x-x^N)/((1-x)(1-x²)(1-x³)...(1-x^N)) for N = 3. A60022

Dirichlet g.f.: 1 / ζ(s)⁷. A341833

a(n) = prime(n)-n*τ(n) where τ(n) is the number of divisors of n. A67292

Inverse Riordan triangle of A106513: Riordan ((1 - 2·x² )/(1 + x), x/(1+x)). A248156