Properties of the Number -442368

Four Hundred Forty-Two Thousand Three Hundred Sixty-Eight

Basics

Value: -442369 → -442368 → -442367

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ¹⁴ × 3 ³

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 16, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1101100000000000000

Octal: -1540000

Duodecimal: -194000

Hexadecimal: -6c000

Square: 195689447424

Square Root: 665.1075101064489

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: Yes

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) = (1-2n)*2ⁿ. A143126

Expansion of 1/∑_k>=0 A000326(k+1)*x^k. A296775

Numerator of frequency of integers with smallest divisor prime(n). A38110

a(n) = solution to the "Select All, Copy, Paste" problem: Given the ability to type a single letter, or to type individual "Select All", "Copy" or "Paste" command keystrokes, what is the maximal number of letters of text that can be obtained with n keystrokes? A178715

Numbers k such that Sum_i ( e(i)/p(i) ) is an integer, where the prime factorization of k is Product_i ( p(i)^e(i) ). A72873

17-almost primes (generalization of semiprimes). A69278

Orders of finite Abelian groups having the incrementally largest numbers of nonisomorphic forms (A046054). A46055

Number of permutations of 3 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum. A159721

a(n) = floor(1/{(1+n⁴)^1/4}), where {} = fractional part. A184536

a(n) = ∏_k=0..9 floor((n+k)/10). A354600