Properties of the Number -7314

Three Hundred Fourteen

Basics

Value: -7315 → -7314 → -7313

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 23 × 53

Divisors: 1, 2, 3, 6, 23, 46, 53, 69, 106, 138

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1110010010010

Octal: -16222

Duodecimal: -4296

Hexadecimal: -1c92

Square: 53494596

Square Root: 85.5219270129012

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

Expansion of x²*(-3+4·x)/(1-x³+x⁴). A110061

Numbers m such that the factorizations of m..m+3 have the same number of primes (including multiplicities). A45940

Numbers k such that k and k+1 have 4 distinct prime factors. A140078

Number of semi-sums of strict integer partitions of n. A366741

a(n) = ∑_k=0..2·n-1 T(n,k) * T(n,k+1), with T given by A026584. A27283

Heinz numbers of integer partitions with as many even parts as odd parts and as many even conjugate parts as odd conjugate parts. A350946

a(n) is the smallest number m such that each of the numbers m and m+1 has n distinct prime divisors. A93548

a(n) = a(n-1) + a(m) for n >= 3, where m = 2^p+1 + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1 and a(2) = 2. A50049

a(n) = binomial(n+5,4) - 1. A63258

a(n) = smallest number m such that m and m+1 are the product of exactly n distinct primes. A52215