Properties of the Number -151

One Hundred Fifty-One

Basics

Value: -152 → -151 → -150

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 7

Digital Root: 7

Palindrome: Yes

Factorization: 151

Divisors: 1, 151

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -10010111

Octal: -227

Duodecimal: -107

Hexadecimal: -97

Square: 22801

Square Root: 12.288205727444508

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

G.f.: Re((i; x)_inf), where (a; q)_inf is the q-Pochhammer symbol, i = sqrt(-1). A278399

Expansion of (1-x-x^N)/((1-x)(1-x²)(1-x³)...(1-x^N)) for N = 7. A60026

Signed row sums of A066667. A66668

Expansion of e.g.f. arctan(x·exp(x)). A191719

E.g.f. A(x) satisfies A(x) = exp(-x·A(x)³) + x·A(x)³. A379871

Signed primes: if prime(n) even, a(n) = 0; if prime(n) == 1 (mod 4), a(n) = prime(n); if prime(n) == -1 (mod 4), a(n) = -prime(n). A73579

Sequence is {a(3,n)}, where a(m,n) is defined at sequence A111518. A111521