Properties of the Number -302

Three Hundred Two

Basics

Value: -303 → -302 → -301

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 5

Digital Root: 5

Palindrome: No

Factorization: 2 × 151

Divisors: 1, 2, 151, 302

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -100101110

Octal: -456

Duodecimal: -212

Hexadecimal: -12e

Square: 91204

Square Root: 17.378147196982766

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

Alternating sum σ(1)-σ(2)+σ(3)-σ(4)+...+((-1)ⁿ⁺¹)*σ(n). A68762

a(n) = (-4·n³ + 27·n² - 20·n + 3)/3. A161711

Triangle read by rows, application of the transformation A337966 to Euler's triangle A173018. T(n, k) for 0 <= k <= n. A337967

Expansion of ∑_k>0 (1/(1+x^k)³ - 1). A363630

(Product of primes <= n) - 2^n-1. A68511

G.f.: ∏_k>0 (1 - x^k)⁴ * (1 - (-x)^k)⁸. A225543

G.f.: x^(k²+k/2)/(mul(1-xⁱ,i=1..k)*mul(1+x^r,r=1..oo)) with k = 4. A246583

Expansion of e.g.f. exp(1 - cos(x) + sin(x)). A352377

8th differences of primes. A36269

Triangle read by rows. T(n, k) = numerator(Integral_z=0..1 Eulerian(n, k)*z^{k + 1}*(z - 1)^{n - k - 1} dz), where Eulerian(n, k) = A173018(n, k) for n >= 1, and T(0, 0) = 1. A356602