Properties of the Number -296449

Two Hundred Ninety-Six Thousand Four Hundred Forty-Nine

Basics

Value: -296450 → -296449 → -296448

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 34

Digital Root: 7

Palindrome: No

Factorization: 521 × 569

Divisors: 1, 521, 569, 296449

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -1001000011000000001

Octal: -1103001

Duodecimal: -123681

Hexadecimal: -48601

Square: 87882009601

Square Root: 544.4713031923721

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

Bases b where exactly ten primes p with p < b exist such that p is a base-b Wieferich prime. A325886

Smallest b such that the k consecutive primes starting with prime(n) are all base-b Wieferich primes, i.e., satisfy b^p-1 == 1 (mod p²). Square array A(n, k), read by antidiagonals downwards. A286816

A(n, k) is the k-th number b > 1 such that b^prime(n+i-1) == 1 (mod prime(n+i)²) for each i = 0..4, with k running over the positive integers; square array, read by antidiagonals, downwards. A319062

A(n, k) is the k-th number b > 1 such that b^prime(n+i-1) == 1 (mod prime(n+i)²) for each i = 0..5, with k running over the positive integers; square array, read by antidiagonals, downwards. A319063

a(n) is the smallest b > 1 such that prime(n), prime(n+1), prime(n+2), prime(n+3) and prime(n+4) are all base-b Wieferich primes. A344829

a(n) is the smallest b > 1 such that prime(n), prime(n+1), prime(n+2), prime(n+3), prime(n+4) and prime(n+5) are all base-b Wieferich primes. A344830

Smallest base b such that there exist exactly n Wieferich pseudoprimes (composites c satisfying b^c-1 == 1 (mod c²)) less than b. A255885

a(n) = 2048n² + 128n + 1. A157476

Numerators of continued fraction convergents to sqrt(579). A42108

Triangle read by rows: T(n, k) = smallest base b > 1 such that p = prime(n) is the k-th base-b Wieferich prime for k = 1, 2, 3, ..., n. A258787