Properties of the Number -7303

Three Hundred Three

Basics

Value: -7304 → -7303 → -7302

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 67 × 109

Divisors: 1, 67, 109, 7303

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1110010000111

Octal: -16207

Duodecimal: -4287

Hexadecimal: -1c87

Square: 53333809

Square Root: 85.45759182190895

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

Number of subsets of {1..n} containing some element equal to the sum of two or more distinct other elements. A variation of sum-full subsets without re-used elements. A364534

Coordination sequence for 3D uniform tiling formed by stacking parallel layers of the 3⁴.6 2D tiling (cf. A250120). A299254

Coordination sequence for 3D uniform tiling formed by stacking parallel layers of the 3.3.4.3.4 2D tiling (cf. A219529). A299255

Golden semiprimes: a(n)=p·q and abs(p*φ-q)<1, where φ = golden ratio = (1+sqrt(5))/2. A108540

Number of integer partitions of n such that the maximum is greater than or equal to twice the median. A361859

Numbers k such that 3·2^k + 35 is prime. A59759

Numbers n whose square can be represented as a repdigit number in some base less than n. A158235

Construct sequences P,Q,R by the rules: Q = first differences of P, R = second differences of P, P starts with 1,5,11, Q starts with 4,6, R starts with 2; at each stage the smallest number not yet present in P,Q,R is appended to R; every number appears exactly once in the union of P,Q,R. Sequence gives P. A225376

Convolution square of A255528. A278710

Let u(1) = x and u(n+1) = (n²/u(n)) + 1 for n >= 1; then a(n) is such that u(n) = (b(n)*x + c(n))/(d(n)*x + a(n)) (in lowest terms) and a(n), b(n), c(n), d(n) are positive integers. A75829